Readings in nonmonotonic reasoning
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Datalog LITE: a deductive query language with linear time model checking
ACM Transactions on Computational Logic (TOCL)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Horn clauses and the fixpoint query hierarchy
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Omega-Restricted Logic Programs
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Pushing Goal Derivation in DLP Computations
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
ASSAT: computing answer sets of a logic program by SAT solvers
Eighteenth national conference on Artificial intelligence
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Nonmonotonic ontological and rule-based reasoning with extended conceptual logic programs
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Open answer set programming with guarded programs
ACM Transactions on Computational Logic (TOCL)
Guarded hybrid knowledge bases12
Theory and Practice of Logic Programming
A Coherent Well-founded Model for Hybrid MKNF Knowledge Bases
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web
Journal on Data Semantics XII
Embedding non-ground logic programs into autoepistemic logic for knowledge-base combination
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Towards tractable local closed world reasoning for the semantic web
EPIA'07 Proceedings of the aritficial intelligence 13th Portuguese conference on Progress in artificial intelligence
On representational issues about combinations of classical theories with nonmonotonic rules
KSEM'06 Proceedings of the First international conference on Knowledge Science, Engineering and Management
Guarded open answer set programming with generalized literals
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Taming the infinite chase: query answering under expressive relational constraints
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program's constants. We define a fixed point logic (FPL) extension of Clark's completion such that open answer sets correspond to models of FPL formulas and identify a syntactic subclass of programs, called (loosely) guarded programs. Whereas reasoning with general programs in OASP is undecidable, the FPL translation of (loosely) guarded programs falls in the decidable (loosely) guarded fixed point logic (μ(L)GF). Moreover, we reduce normal closed ASP to loosely guarded OASP, enabling a characterization of an answer set semantics by μLGF formulas. Finally, we relate guarded OASP to Datalog LITE, thus linking an answer set semantics to a semantics based on fixed point models of extended stratified Datalog programs. From this correspondence, we deduce 2-EXPTIME-completeness of satisfiability checking w.r.t. (loosely) guarded programs.