The expressive powers of the logic programming semantics

DOI10.1006/JCSS.1995.1053zbMATH Open0831.68012OpenAlexW2043182143MaRDI QIDQ1900917FDOQ1900917

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

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 Keywords

semanticsinfinite Herbrand universes

Mathematics Subject Classification ID

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

Cited In (33)

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

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)