The expressive powers of the logic programming semantics
From MaRDI portal
Recommendations
Cited in
(35)- On the equivalence and range of applicability of graph-based representations of logic programs.
- Abduction from logic programs: Semantics and complexity
- Logic programming: laxness and saturation
- “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics
- Computer Science Logic
- Magic Sets and their application to data integration
- Some (in)translatability results for normal logic programs and propositional theories
- 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
- scientific article; zbMATH DE number 1841812 (Why is no real title available?)
- Nested expressions in logic programs
- Aggregate semantics for propositional answer set programs
- \(FO(FD)\): extending classical logic with rule-based fixpoint definitions
- On the strong completion of logic programs
- On the complexity of single-rule datalog queries.
- Writing declarative specifications for clauses
- Recursive rules with aggregation: a simple unified semantics
- Expressiveness of logic programs under the general stable model 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
- S-semantics for logic programming: a retrospective look
- Extending Logic Programming with Labelled Variables: Model and Semantics
- The role of standardising apart in logic programming
- scientific article; zbMATH DE number 1696840 (Why is no real title available?)
- Revision programming
- What is answer set programming to propositional satisfiability
- The well-founded semantics for general logic programs
- scientific article; zbMATH DE number 4155872 (Why is no real title available?)
- \(\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
- Tie-breaking semantics and structural totality
- Complexity results for answer set programming with bounded predicate arities and implications
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)
