Index Sets for Finite Normal Predicate Logic Programs with Function Symbols

DOI10.1007/978-3-319-27683-0_5zbMath1474.68041OpenAlexW2296002977MaRDI QIDQ5283418

Victor W. Marek, Douglas Cenzer, Jeffery B. Remmel

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

zbMATH Keywords

logic programmingindex setsrecursive trees

Mathematics Subject Classification ID

Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15) Logic programming (68N17) Theory of numerations, effectively presented structures (03D45)

Related Items

Index Sets for Finite Normal Predicate Logic Programs with Function Symbols

Uses Software

• Smodels

Cites Work

• Reasoning with infinite stable models
• How complicated is the set of stable models of a recursive logic program?
• Index sets for \(\Pi^0_1\) classes
• A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs
• The Stable Models of a Predicate Logic Program
• Checking termination of bottom-up evaluation of logic programs with function symbols
• The DLV system for knowledge representation and reasoning
• Index Sets for Finite Normal Predicate Logic Programs with Function Symbols
• One More Decidable Class of Finitely Ground Programs
• Conflict-Driven Answer Set Enumeration
• Computable Functions in ASP: Theory and Implementation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item