Semantical considerations on nonmonotonic logic
Artificial Intelligence
Readings in nonmonotonic reasoning
Readings in nonmonotonic reasoning
On the relation between default and autoepistemic logic
Artificial Intelligence
Foundations of deductive databases and logic programming
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Negation as failure using tight derivations for general logic programs
Foundations of deductive databases and logic programming
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
Decision Procedure for Autoepistemic Logic
Proceedings of the 9th International Conference on Automated Deduction
Graphs and Hypergraphs
Modal nonmonotonic logics: ranges, characterization, computation
Journal of the ACM (JACM)
Negation and minimality in non-horn databases
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity aspects of various semantics for disjunctive databases
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query evaluation under the well-founded semantics
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
NP trees and Carnap's modal logic
Journal of the ACM (JACM)
Translating default logic into standard autoepistemic logic
Journal of the ACM (JACM)
Tabled evaluation with delaying for general logic programs
Journal of the ACM (JACM)
Logic programming revisited: logic programs as inductive definitions
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Logic programming and knowledge representation-the A-prolog perspective
Artificial Intelligence
"Possible is certain'' is desirable and can be expressive
Annals of Mathematics and Artificial Intelligence
Logic knowledge bases with two default rules
Annals of Mathematics and Artificial Intelligence
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Semantics and expressiveness of disjunctive ordered logic
Annals of Mathematics and Artificial Intelligence
Fixed-parameter complexity of semantics for logic programs
ACM Transactions on Computational Logic (TOCL)
Computation of Stable Models and Its Integration with Logical Query Processing
IEEE Transactions on Knowledge and Data Engineering
Default Logic as a Query Language
IEEE Transactions on Knowledge and Data Engineering
Dynamic Programming in Datalog with Aggregates
IEEE Transactions on Knowledge and Data Engineering
Enhancing Disjunctive Datalog by Constraints
IEEE Transactions on Knowledge and Data Engineering
Propositional default logics made easier: computational complexity of model checking
Theoretical Computer Science
Disjunctive Logic Programming: A Survey and Assessment
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Representing Knowledge in A-Prolog
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Search and Optimization Problems in Datalog
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Answer Set Programming by Ant Colony Optimization
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Minimal Founded Semantics for Disjunctive Logic Programming
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Omega-Restricted Logic Programs
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
On the Expressibility of Stable Logic Programming
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Stable Model Semantics of Weight Constraint Rules
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
On the Computational Aspect of Rule Based Database Updates
Proceedings of the 14th International conference on Industrial and engineering applications of artificial intelligence and expert systems: engineering of intelligent systems
Including Diagnostic Information in Configuration Models
CL '00 Proceedings of the First International Conference on Computational Logic
Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs
CL '00 Proceedings of the First International Conference on Computational Logic
On the Problem of Computing the Well-Founded Semantics
CL '00 Proceedings of the First International Conference on Computational Logic
New Generation Computing
Nonmonotonic reasoning: towards efficient calculi and implementations
Handbook of automated reasoning
Complexity and Expressive Power of Logic Programming
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Proceedings of the 2004 ACM symposium on Applied computing
A logic programming approach to knowledge-state planning: Semantics and complexity
ACM Transactions on Computational Logic (TOCL)
On the expressibility of stable logic programming
Theory and Practice of Logic Programming
Minimal founded semantics for disjunctive logic programs and deductive databases
Theory and Practice of Logic Programming
Disjunctive logic programs with inheritance
Theory and Practice of Logic Programming
On properties of update sequences based on causal rejection
Theory and Practice of Logic Programming
Computing large and small stable models
Theory and Practice of Logic Programming
Theory and Practice of Logic Programming
Transformation-based bottom-up computation of the well-founded model
Theory and Practice of Logic Programming
On the problem of computing the well-founded semantics
Theory and Practice of Logic Programming
Knowledge and the action description language 𝒜
Theory and Practice of Logic Programming
Declarative semantics for active rules
Theory and Practice of Logic Programming
Ultimate approximation and its application in nonmonotonic knowledge representation systems
Information and Computation
Event choice datalog: a logic programming language for reasoning in multiple dimensions
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Ordering default theories and nonmonotonic logic programs
Theoretical Computer Science
Unfolding partiality and disjunctions in stable model semantics
ACM Transactions on Computational Logic (TOCL)
Why are there so many loop formulas?
ACM Transactions on Computational Logic (TOCL)
ACM Transactions on Computational Logic (TOCL)
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Any-world assumptions in logic programming
Theoretical Computer Science
DisLoP: a research project on Disjunctive Logic Programming
AI Communications
Complexity results for answer set programming with bounded predicate arities and implications
Annals of Mathematics and Artificial Intelligence
An ASP-based approach to dealing with agent perception failure
AI Communications
Predicate Introduction for Logics with Fixpoint Semantics. Part II: Autoepistemic Logic
Fundamenta Informaticae
A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Declarative Semantics for Active Integrity Constraints
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Design and implementation of aggregate functions in the dlv system*
Theory and Practice of Logic Programming
Achieving compositionality of the stable model semantics for smodels programs1
Theory and Practice of Logic Programming
Exploiting conjunctive queries in description logic programs
Annals of Mathematics and Artificial Intelligence
Journal of Experimental & Theoretical Artificial Intelligence
Consistency property of finite FC-normal logic programs
Journal of Computer Science and Technology
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
An experimental comparison of constraint logic programming and answer set programming
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Space efficiency of propositional knowledge representation formalisms
Journal of Artificial Intelligence Research
A hierarchy of tractable subsets for computing stable models
Journal of Artificial Intelligence Research
Epistemic reasoning in logic programs
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
On the relation between default and modal nonmonotonic reasoning
Artificial Intelligence
On a Modal Epistemic Axiom Emerging from McDermott-Doyle Logics
Fundamenta Informaticae
Towards the computation of stable probabilistic model semantics
KI'06 Proceedings of the 29th annual German conference on Artificial intelligence
Modularity in SMODELS programs
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Logic programming for knowledge representation
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Data conflict resolution using trust mappings
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Annals of Mathematics and Artificial Intelligence
Logic programs with propositional connectives and aggregates
ACM Transactions on Computational Logic (TOCL)
Answer set programming's contributions to classical logic: an analysis of ASP methodology
Logic programming, knowledge representation, and nonmonotonic reasoning
Revisiting epistemic specifications
Logic programming, knowledge representation, and nonmonotonic reasoning
Logic programming, knowledge representation, and nonmonotonic reasoning
Fuzzy autoepistemic logic: reflecting about knowledge of truth degrees
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Rules and logic programming for the web
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Answer set programming at a glance
Communications of the ACM
A comparison of CLP(FD) and ASP solutions to NP-Complete problems
ICLP'05 Proceedings of the 21st international conference on Logic Programming
On modular translations and strong equivalence
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Structure-based algorithms for computing preferred arguments of defeasible knowledge bases
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Operational semantics for DyLPs
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
Predicate introduction under stable and well-founded semantics
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Magic sets and their application to data integration
ICDT'05 Proceedings of the 10th international conference on Database Theory
Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
Theory and Practice of Logic Programming
Active integrity constraints and revision programming
Theory and Practice of Logic Programming
A logic for knowledge, correctness, and real time
CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
The Complexity of Reasoning for Fragments of Autoepistemic Logic
ACM Transactions on Computational Logic (TOCL)
Simple but hard mixed horn formulas
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Answer set modules for logical agents
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Backdoors to tractable answer-set programming
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Oscillating behavior of logic programs
Correct Reasoning
Possible world semantics for defeasible deontic logic
DEON'12 Proceedings of the 11th international conference on Deontic Logic in Computer Science
Predicate Introduction for Logics with Fixpoint Semantics. Part II: Autoepistemic Logic
Fundamenta Informaticae
Conflict, consistency and truth-dependencies in graph representations of answer set logic programs
GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning
Stable Models for Stubborn Sets
Fundamenta Informaticae
On the Complexity of Perfect Models of Logic Programs
Fundamenta Informaticae
Complexity of Recursive Normal Default Logic
Fundamenta Informaticae
Approximating the Stable Model Semantics is Hard
Fundamenta Informaticae
Semantics For Disjunctive Logic Programs With Explicit And Default Negation
Fundamenta Informaticae
Foundations of rule-based query answering
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
Data exchange in datalog is mainly a matter of choice
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Tableau Calculi for Logic Programs under Answer Set Semantics
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.02 |
Autoepistemic logic is one of the principal modes of nonmonotonicreasoning. It unifies several other modes of nonmonotonic reasoning andhas important application in logic programming. In the paper, a theoryof autoepistemic logic is developed. This paper starts with a briefsurvey of some of the previously known results. Then, the nature ofnonmonotonicity is studied by investigating how membership ofautoepistemic statements in autoepistemic theories depends on theunderlying objective theory. A notion similar to set-theoretic forcingis introduced. Expansions of autoepistemic theories are alsoinvestigated. Expansions serve as sets of consequences of anautoepistemic theory and they can also be used to define semantics forlogic programs with negation. Theories that have expansions arecharacterized, and a normal form that allows the description of allexpansions of a theory is introduced. Our results imply algorithms todetermine whether a theory has a unique expansion. Sufficient conditions(stratification) that imply existence of a unique expansion arediscussed. The definition of stratified theories is extended and (undersome additional assumptions) efficient algorithms for testing whether atheory is stratified are proposed. The theorem characterizing expansionsis applied to two classes of theories, K1-theoriesand ae-programs. In each case, simple hypergraph characterization ofexpansions of theories from each of these classes is given. Finally,connections with stable model semantics for logic programs with negationis discussed. In particular, it is proven that the problem of existenceof stable models is NP-complete.—Authors' Abstract