Foundations of deductive databases and logic programming
Foundations of deductive databases and logic programming
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
Extending and implementing the stable model semantics
Artificial Intelligence
A logic programming approach to knowledge-state planning: Semantics and complexity
ACM Transactions on Computational Logic (TOCL)
Reasoning with infinite stable models
Artificial Intelligence
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Bridging the gap between OWL and relational databases
Proceedings of the 16th international conference on World Wide Web
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
Rules and Ontologies for the Semantic Web
Reasoning Web
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Partial Functions and Equality in Answer Set Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Computable Functions in ASP: Theory and Implementation
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Composing Normal Programs with Function Symbols
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
On finitely recursive programs1
Theory and Practice of Logic Programming
Hybrid Reasoning with Forest Logic Programs
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Weight Constraint Programs with Functions
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Worst-case optimal conjunctive query answering for an expressive description logic without inverses
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Bidirectional answer set programs with function symbols
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A decidable subclass of finitary programs
Theory and Practice of Logic Programming
Disjunctive asp with functions: Decidable queries and effective computation*
Theory and Practice of Logic Programming
A 25-year perspective on logic programming
Functional answer set programming
Theory and Practice of Logic Programming
Synonymous theories and knowledge representations in answer set programming
Journal of Computer and System Sciences
Finitely recursive programs: Decidability and bottom-up computation
AI Communications
Automata for infinite argumentation structures
Artificial Intelligence
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
| Hi-index | 0.00 |
Current Answer Set Programming systems are built on nonmonotonic logic programs without function symbols; as well-known, they lead to high undecidability in general. However, function symbols are highly desirable for various applications, which challenges to find meaningful and decidable fragments of this setting. We present the class FDNC of logic programs which allows for function symbols, disjunction, nonmonotonic negation under answer set semantics, and constraints, while still retaining the decidability of the standard reasoning tasks. Thanks to these features, they are a powerful formalism for rule-based modeling of applications with potentially infinite processes and objects, which allows also for common-sense reasoning. We show that consistency checking and brave reasoning are ExpTime-complete in general, but have lower complexity for restricted fragments, and outline worst-case optimal reasoning procedures for these tasks. Furthermore, we present a finite representation of the possibly infinitely many infinite stable models of an FDNC program, which may be exploited for knowledge compilation purposes.