Index sets for finite normal predicate logic programs with function symbols

DOI10.1007/978-3-319-27683-0_5MaRDI QIDQ5283418zbMATH OpenOpenAlexFDO

Authors Douglas Cenzer, Wiktor Marek, Jeffrey 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

index setslogic programmingrecursive trees

Mathematics Subject Classification ID

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

Recommendations

• On the complexity of index sets for finite predicate logic programs which allow function symbols
• The Stable Models of a Predicate Logic Program
• New Computational Paradigms
• Logic Programs for Primitive Recursive Sets
• Logic programming with infinite sets

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 4199630 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 3782373 (Why is no real title available?)
• scientific article; zbMATH DE number 1884395 (Why is no real title available?)
• scientific article; zbMATH DE number 789391 (Why is no real title available?)
• scientific article; zbMATH DE number 3274715 (Why is no real title available?)
• A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs
• Checking termination of bottom-up evaluation of logic programs with function symbols
• Computable Functions in ASP: Theory and Implementation
• 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
• Index sets for finite normal predicate logic programs with function symbols
• One More Decidable Class of Finitely Ground Programs
• Reasoning with infinite stable models
• The DLV system for knowledge representation and reasoning
• The Stable Models of a Predicate Logic Program

Cited in

(3)

• On the complexity of index sets for finite predicate logic programs which allow function symbols
• Index sets for finite normal predicate logic programs with function symbols
• Pre-indexed Terms for Prolog

Describes a project that uses

Uses Software

• Smodels

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)