The expressiveness of locally stratified programs

DOI10.1007/BF01534455MaRDI QIDQ1924734zbMATH OpenFDO

Authors Howard A. Blair, Wiktor Marek, John S. Schlipf

Publication date 3 February 1997

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

Full work available at URL https://doi.org/10.1007/BF01534455

zbMATH Keywords

Horn logicKleene's hyperarithmetical hierarchylocally stratified logic program

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• The expressive power of stratified logic programs
• scientific article; zbMATH DE number 4147557
• The well-founded semantics for general logic programs
• ``Possible is certain is desirable and can be expressive
• The expressive powers of the logic programming semantics

Cites work

• scientific article; zbMATH DE number 4199630 (Why is no real title available?)
• scientific article; zbMATH DE number 4199656 (Why is no real title available?)
• scientific article; zbMATH DE number 4147557 (Why is no real title available?)
• scientific article; zbMATH DE number 4104925 (Why is no real title available?)
• scientific article; zbMATH DE number 3782373 (Why is no real title available?)
• scientific article; zbMATH DE number 25189 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 3466489 (Why is no real title available?)
• scientific article; zbMATH DE number 3577197 (Why is no real title available?)
• scientific article; zbMATH DE number 708664 (Why is no real title available?)
• scientific article; zbMATH DE number 1142320 (Why is no real title available?)
• scientific article; zbMATH DE number 789391 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A theory of nonmonotonic rule systems I
• Computability of Recursive Functions
• How complicated is the set of stable models of a recursive logic program?
• The Semantics of Predicate Logic as a Programming Language
• The expressive power of stratified logic programs
• The recursion-theoretic complexity of the semantics of predicate logic as a programming language
• The well-founded semantics for general logic programs
• Theory of Formal Systems. (AM-47)

Cited in

(12)

• Logic programming with infinite sets
• Arranging program statements for locality on the basis of neighbourhood preferences
• Automata and Answer Set Programming
• A context for belief revision: forward chaining-normal nonmonotonic rule systems
• Reasoning with infinite stable models
• The defining power of stratified and hierarchical logic programs
• On the computational cost of disjunctive logic programming: Propositional case
• scientific article; zbMATH DE number 4147557 (Why is no real title available?)
• Complexity and undecidability results for logic programming
• Game characterizations of logic program properties
• Testing logic programs for local stratification
• scientific article; zbMATH DE number 5173454 (Why is no real title available?)

This page was built for publication: The expressiveness of locally stratified programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924734)