The expressive powers of the logic programming semantics
From MaRDI portal
Publication:1900917
DOI10.1006/jcss.1995.1053zbMath0831.68012OpenAlexW2043182143MaRDI QIDQ1900917
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
Related Items
Expressiveness of Logic Programs under the General Stable Model Semantics, Recursive rules with aggregation: a simple unified semantics, The expressive powers of stable models for bound and unbound DATALOG queries, Circumscribing DATALOG: expressive power and complexity, Magic Sets and their application to data integration, A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs, Revision programming, Abduction from logic programs: Semantics and complexity, On the complexity of single-rule datalog queries., Complexity results for answer set programming with bounded predicate arities and implications, What is answer set programming to propositional satisfiability, atalog: A logic language for expressing search and optimization problems, Tie-breaking semantics and structural totality, Conflict-driven answer set solving: from theory to practice, FO(FD): Extending classical logic with rule-based fixpoint definitions, Expressive power and complexity of partial models for disjunctive deductive databases, Some (in)translatability results for normal logic programs and propositional theories, Writing Declarative Specifications for Clauses, On the equivalence and range of applicability of graph-based representations of logic programs.
