Nonmonotonic logic and temporal projection
Artificial Intelligence
Unification as a complexity measure for logic programming
Journal of Logic Programming
Finite representation of infinite query answers
ACM Transactions on Database Systems (TODS)
Proceedings of the eleventh international conference on Logic programming
ACM Transactions on Database Systems (TODS)
An action language based on causal explanation: preliminary report
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Proceedings of the 1999 international conference on Logic programming
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Answer set programming and plan generation
Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
A Deductive System for Non-Monotonic Reasoning
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Encoding Planning Problems in Nonmonotonic Logic Programs
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Some Results on the Complexity of Planning with Incomplete Information
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
A logic programming approach to knowledge-state planning, II: the DLVk system
Artificial Intelligence
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
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
Reasoning with infinite stable models
Artificial Intelligence
Domain-dependent knowledge in answer set planning
ACM Transactions on Computational Logic (TOCL)
A survey on knowledge compilation
AI Communications
Bridging the gap between OWL and relational databases
Proceedings of the 16th international conference on World Wide Web
Theory and Practice of Logic Programming
Conformant planning for domains with constraints: a new approach
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Journal of Artificial Intelligence Research
An extension to conformant planning using logic programming
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A correspondence theory for terminological logics: preliminary report
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
A uniform integration of higher-order reasoning and external evaluations in answer-set programming
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
On finitely recursive programs
ICLP'07 Proceedings of the 23rd international conference on Logic programming
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
Fusion of Logic Programming and Description Logics
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Hybrid reasoning with rules and ontologies
Semantic techniques for the web
Weight constraint programs with evaluable functions
Annals of Mathematics and Artificial Intelligence
Answer set programming at a glance
Communications of the ACM
Conjunctive query answering in the description logic SH using knots
Journal of Computer and System Sciences
A general Datalog-based framework for tractable query answering over ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
Finitely recursive programs: Decidability and bottom-up computation
AI Communications
Simulating production rules using ACTHEX
Correct Reasoning
Towards more expressive ontology languages: The query answering problem
Artificial Intelligence
Automata for infinite argumentation structures
Artificial Intelligence
Computing stable models for nonmonotonic existential rules
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.02 |
We present the class FDNC of logic programs that allows for function symbols (F), disjunction (D), nonmonotonic negation under the answer set semantics (N), and constraints (C), while still retaining the decidability of the standard reasoning tasks. Thanks to these features, FDNC programs are a powerful formalism for rule-based modeling of applications with potentially infinite processes and objects, and which allows also for common-sense reasoning in this context. This is evidenced, for instance, by tasks in reasoning about actions and planning: brave and open queries over FDNC programs capture the well-known problems of plan existence and secure (conformant) plan existence, respectively, in transition-based actions domains. As for reasoning from FDNC programs, we show that consistency checking and brave/cautious reasoning tasks are ExpTime-complete in general, but have lower complexity under syntactic restrictions that give rise to a family of program classes. Furthermore, we also determine the complexity of open queries (i.e., with answer variables), for which deciding non-empty answers is shown to be ExpSpace -complete under cautious entailment. Furthermore, we present algorithms for all reasoning tasks that are worst-case optimal. The majority of them resorts to a finite representation of the stable models of an FDNC program that employs maximal founded sets of knots, which are labeled trees of depth at most 1 from which each stable model can be reconstructed. Due to this property, reasoning over FDNC programs can in many cases be reduced to reasoning from knots. Once the knot-representation for a program is derived (which can be done off-line), several reasoning tasks are not more expensive than in the function-free case, and some are even feasible in polynomial time. This knowledge compilation technique paves the way to potentially more efficient online reasoning methods not only for FDNC, but also for other formalisms.