The expressive powers of the logic programming semantics

DOI10.1006/JCSS.1995.1053MaRDI QIDQ1900917zbMATH OpenOpenAlexFDO

Authors John S. Schlipf

Publication date 25 October 1995

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcss.1995.1053

zbMATH Keywords

semanticsinfinite Herbrand universes

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• The well-founded semantics for general logic programs
• The expressive power of stratified logic programs
• Complexity and undecidability results for logic programming
• scientific article; zbMATH DE number 25192
• scientific article; zbMATH DE number 4199653

Cited in

(34)

• Magic Sets and their application to data integration
• A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs
• S-semantics for logic programming: a retrospective look
• Nested expressions in logic programs
• The role of standardising apart in logic programming
• The well-founded semantics for general logic programs
• Complexity results for answer set programming with bounded predicate arities and implications
• Expressiveness of logic programs under the general stable model semantics
• Logic programming: laxness and saturation
• Abduction from logic programs: Semantics and complexity
• On the expressibility of stable logic programming
• \(FO(FD)\): extending classical logic with rule-based fixpoint definitions
• Tie-breaking semantics and structural totality
• Recursive rules with aggregation: a simple unified semantics
• On the equivalence and range of applicability of graph-based representations of logic programs.
• The expressive powers of stable models for bound and unbound DATALOG queries
• Circumscribing DATALOG: expressive power and complexity
• Revision programming
• Some (in)translatability results for normal logic programs and propositional theories
• Writing declarative specifications for clauses
• The expressive power of side effects in prolog
• The expressive power of stratified logic programs with value invention
• What is answer set programming to propositional satisfiability
• \(\mathcal {NPD}\)atalog: A logic language for expressing \(\mathcal {NP}\) search and optimization problems
• scientific article; zbMATH DE number 1841812 (Why is no real title available?)
• On the complexity of single-rule datalog queries.
• scientific article; zbMATH DE number 1696840 (Why is no real title available?)
• scientific article; zbMATH DE number 4155872 (Why is no real title available?)
• Computer Science Logic
• “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics
• Expressive power and complexity of partial models for disjunctive deductive databases
• On the strong completion of logic programs
• Extending Logic Programming with Labelled Variables: Model and Semantics
• Conflict-driven answer set solving: from theory to practice

This page was built for publication: The expressive powers of the logic programming semantics

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