The expressiveness of locally stratified programs

DOI10.1007/BF01534455zbMath0855.68016MaRDI QIDQ1924734

Howard A. Blair, Victor W. Marek, John S. Schlipf

Publication date: 3 February 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

Horn logicKleene's hyperarithmetical hierarchylocally stratified logic program

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

A context for belief revision: forward chaining-normal nonmonotonic rule systems ⋮ Complexity and undecidability results for logic programming ⋮ On the computational cost of disjunctive logic programming: Propositional case ⋮ Game characterizations of logic program properties ⋮ Automata and Answer Set Programming ⋮ Logic programming with infinite sets ⋮ Reasoning with infinite stable models

Cites Work

• The expressive power of stratified logic programs
• How complicated is the set of stable models of a recursive logic program?
• A theory of nonmonotonic rule systems I
• The recursion-theoretic complexity of the semantics of predicate logic as a programming language
• Theory of Formal Systems. (AM-47)
• The Semantics of Predicate Logic as a Programming Language
• The well-founded semantics for general logic programs
• Computability of Recursive Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item