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

DOI10.1007/978-3-540-75560-9_37MaRDI QIDQ3498490zbMATH OpenOpenAlexFDO

Authors 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 programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• FDNC: decidable nonmonotonic disjunctive logic programs with function symbols
• Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols
• Logic Programming
• On functional symbol-free logic programs
• Polynomial and Exponential Bounded Logic Programs with Function Symbols: Some New Decidable Classes
• scientific article; zbMATH DE number 4200180
• Expressiveness of stable model semantics for disjunctive logic programs with functions
• scientific article; zbMATH DE number 1088020
• scientific article; zbMATH DE number 6387492
• Overview of an abstract fixed point theory for non-monotonic functions and its applications to logic programming

Cites work

• scientific article; zbMATH DE number 4147465 (Why is no real title available?)
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• A logic programming approach to knowledge-state planning, semantics and complexity
• Expressiveness of stable model semantics for disjunctive logic programs with functions
• Extending and implementing the stable model semantics
• Foundations of Information and Knowledge Systems
• How complicated is the set of stable models of a recursive logic program?
• On Finitely Recursive Programs
• On the Expressibility of Stable Logic Programming
• On the computational cost of disjunctive logic programming: Propositional case
• Reasoning with infinite stable models
• The DLV system for knowledge representation and reasoning

Cited in

(12)

• FDNC: decidable nonmonotonic disjunctive logic programs with function symbols
• Computable Functions in ASP: Theory and Implementation
• Disjunctive ASP with functions: decidable queries and effective computation
• Answer Set Programming: A Primer
• Synonymous theories and knowledge representations in answer set programming
• Partial Functions and Equality in Answer Set Programming
• A decidable subclass of finitary programs
• Tractable query answering and rewriting under description logic constraints
• Composing Normal Programs with Function Symbols
• On finitely recursive programs
• Polynomial and Exponential Bounded Logic Programs with Function Symbols: Some New Decidable Classes
• Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3498490)