\mathbb{FDNC} : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
From MaRDI portal
Publication:3498490
DOI10.1007/978-3-540-75560-9_37zbMATH Open1137.68334OpenAlexW200731164MaRDI QIDQ3498490FDOQ3498490
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
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
- Extending and implementing the stable model semantics
- On the computational cost of disjunctive logic programming: Propositional case
- Title not available (Why is that?)
- Title not available (Why is that?)
- The DLV system for knowledge representation and reasoning
- Reasoning with infinite stable models
- A logic programming approach to knowledge-state planning, semantics and complexity
- On Finitely Recursive Programs
- How complicated is the set of stable models of a recursive logic program?
- On the Expressibility of Stable Logic Programming
- Foundations of Information and Knowledge Systems
- Expressiveness of stable model semantics for disjunctive logic programs with functions
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)
