A survey of complexity results for non-monotonic logics
M Cadoli, M Schaerf - The Journal of Logic Programming, 1993 - Elsevier
This paper surveys the main results appearing in the literature on the computational
complexity of non-monotonic inference tasks. We not only give results about the …
complexity of non-monotonic inference tasks. We not only give results about the …
Ecological non-monotonicity and its effects on complexity and stability of populations, communities and ecosystems
In traditional ecological models, the effects of abiotic and biotic factors are often assumed to
be monotonic, ie either positive, negative or neutral. However, there has been growing …
be monotonic, ie either positive, negative or neutral. However, there has been growing …
Negation by default and unstratifiable logic programs
N Bidoit, C Froidevaux - Theoretical Computer Science, 1991 - Elsevier
The default approach to the theory of logic programs (and deductive databases) is based on
the interpretation of negation by default rules. Default logic is a well-suited formalism to …
the interpretation of negation by default rules. Default logic is a well-suited formalism to …
Dyna: Extending datalog for modern AI
J Eisner, NW Filardo - International Datalog 2.0 Workshop, 2010 - Springer
Modern statistical AI systems are quite large and complex; this interferes with research,
development, and education. We point out that most of the computation involves database …
development, and education. We point out that most of the computation involves database …
General logical databases and programs: Default logic semantics and stratification
N Bidoit, C Froidevaux - Information and Computation, 1991 - Elsevier
Default logic is introduced as a well-suited formalism for defining the declarative semantics
of deductive databases and logic programs. After presenting, in general, how to use default …
of deductive databases and logic programs. After presenting, in general, how to use default …
Negation in rule-based database languages: a survey
N Bidoit - Theoretical computer science, 1991 - Elsevier
This paper surveys and compares different techniques investigated in order to integrate
negation in rule-based query languages. In the context of deductive databases, a rule-based …
negation in rule-based query languages. In the context of deductive databases, a rule-based …
Studies in using a universal exchange and inference language for evidence based medicine. Semi-automated learning and reasoning for PICO methodology …
B Robson - Computers in Biology and Medicine, 2016 - Elsevier
The Q-UEL language of XML-like tags and the associated software applications are
providing a valuable toolkit for Evidence Based Medicine (EBM). In this paper the already …
providing a valuable toolkit for Evidence Based Medicine (EBM). In this paper the already …
Minimal Model Counting via Knowledge Compilation
M Kabir - arXiv preprint arXiv:2409.10170, 2024 - arxiv.org
Counting the number of models of a Boolean formula is a fundamental problem in artificial
intelligence and reasoning. Minimal models of a Boolean formula are critical in various …
intelligence and reasoning. Minimal models of a Boolean formula are critical in various …
A model theoretic approach to update rule programs
N Bidoit, S Maabout - Database Theory—ICDT'97: 6th International …, 1997 - Springer
Abstract Semantics of active rules is generally defined by execution models. The lack of a
clean declarative semantics threats active system reliability. In this paper, a declarative …
clean declarative semantics threats active system reliability. In this paper, a declarative …
Program equilibrium—a program reasoning approach
The concept of program equilibrium, introduced by Howard (Theory and Decision 24 (3):
203–213, 1988) and further formalised by Tennenholtz (Game Econ Behav 49: 363–373 …
203–213, 1988) and further formalised by Tennenholtz (Game Econ Behav 49: 363–373 …