Paraconsistent logic programming
Theoretical Computer Science
Nonmonotonic reasoning: logical foundations of common sense
Nonmonotonic reasoning: logical foundations of common sense
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
A logic for reasoning with inconsistency
Journal of Automated Reasoning
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Sound and efficient closed-world reasoning for planning
Artificial Intelligence
A survey of paraconsistent semantics for logic programs
Handbook of defeasible reasoning and uncertainty management systems
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Introduction to Default Logic
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Fixpoint semantics for logic programming a survey
Theoretical Computer Science
Paraconsistent Declarative Semantics for Extended Logic Programs
Annals of Mathematics and Artificial Intelligence
Computing Circumscription Revisited: A Reduction Algorithm
Journal of Automated Reasoning
Efficient Reasoning Using the Local Closed-World Assumption
AIMSA '00 Proceedings of the 9th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
A Semantic Web Primer
Complexity of propositional nested circumscription and nested abnormality theories
ACM Transactions on Computational Logic (TOCL)
Knowledge Representation Techniques (Studies in Fuzziness and Soft Computing)
Knowledge Representation Techniques (Studies in Fuzziness and Soft Computing)
A paraconsistent logic programming approach for querying inconsistent databases
International Journal of Approximate Reasoning
Paraconsistent Logic Programs with Four-Valued Rough Sets
RSCTC '08 Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Modeling and Reasoning with Paraconsistent Rough Sets
Fundamenta Informaticae
Second Order Quantifier Elimination: Foundations, Computational Aspects and Applications
Second Order Quantifier Elimination: Foundations, Computational Aspects and Applications
Epistemic profiles and belief structures
KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
Paraconsistent reasoning for semantic web agents
Transactions on Compuational Collective Intelligence VI
| Hi-index | 0.00 |
In this paper we consider rule-based query languages with negation in bodies and heads of rules, traditionally denoted by Datalog¬¬. Tractable and at the same time intuitive semantics for Datalog¬¬ has not been provided even though the area of deductive databases is over 30 years old. In this paper we identify sources of the problem and propose a query language, which we call 4QL. The 4QL language supports a modular and layered architecture and provides a tractable framework for many forms of rule-based reasoning both monotonic and nonmonotonic. As the underpinning principle we assume openness of the world, which may lead to the lack of knowledge. Negation in rule heads may lead to inconsistencies. To reduce the unknown/inconsistent zones we introduce simple constructs which provide means for application-specific disambiguation of inconsistent information, the use of Local Closed World Assumption (thus also Closed World Assumption, if needed), as well as various forms of default and defeasible reasoning.