Index Sets for Finite Normal Predicate Logic Programs with Function Symbols
DOI10.1007/978-3-319-27683-0_5zbMATH Open1474.68041OpenAlexW2296002977MaRDI QIDQ5283418FDOQ5283418
Jeffrey Remmel, Wiktor Marek, Douglas Cenzer
Publication date: 21 July 2017
Published in: Logical Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-27683-0_5
Logic programming (68N17) Logic in computer science (03B70) Theory of numerations, effectively presented structures (03D45) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
- The DLV system for knowledge representation and reasoning
- One More Decidable Class of Finitely Ground Programs
- Computable Functions in ASP: Theory and Implementation
- Reasoning with infinite stable models
- Conflict-Driven Answer Set Enumeration
- How complicated is the set of stable models of a recursive logic program?
- Index sets for \(\Pi^0_1\) classes
- The Stable Models of a Predicate Logic Program
- Checking termination of bottom-up evaluation of logic programs with function symbols
- A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs
- Index Sets for Finite Normal Predicate Logic Programs with Function Symbols
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (2)
Uses Software
This page was built for publication: Index Sets for Finite Normal Predicate Logic Programs with Function Symbols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283418)
