$\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols

DOI10.1007/978-3-540-75560-9_37zbMath1137.68334OpenAlexW200731164MaRDI QIDQ3498490

Mantas Šimkus, Thomas Eiter

Publication date: 15 May 2008

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75560-9_37

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)

Related Items (9)

Synonymous theories and knowledge representations in answer set programming ⋮ A decidable subclass of finitary programs ⋮ Disjunctive ASP with functions: Decidable queries and effective computation ⋮ Tractable query answering and rewriting under description logic constraints ⋮ On finitely recursive programs ⋮ Answer Set Programming: A Primer ⋮ Partial Functions and Equality in Answer Set Programming ⋮ Computable Functions in ASP: Theory and Implementation ⋮ Composing Normal Programs with Function Symbols

Cites Work

• Unnamed Item
• Unnamed Item
• Reasoning with infinite stable models
• How complicated is the set of stable models of a recursive logic program?
• Extending and implementing the stable model semantics
• On the computational cost of disjunctive logic programming: Propositional case
• On Finitely Recursive Programs
• Expressiveness of stable model semantics for disjunctive logic programs with functions
• On the Expressibility of Stable Logic Programming
• A logic programming approach to knowledge-state planning
• The DLV system for knowledge representation and reasoning
• Foundations of Information and Knowledge Systems

This page was built for publication: $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols