The infinite-valued semantics: overview, recent results and future directions
From MaRDI portal
Publication:4583316
Recommendations
Cites work
- scientific article; zbMATH DE number 5853298 (Why is no real title available?)
- A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation
- An infinite-game semantics for well-founded negation in logic programming
- Analysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium Logic
- Argumentation-based abduction in disjunctive logic programming
- Characterizations of the disjunctive stable semantics by partial evaluation
- Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA
- Comparisons and computation of well-founded semantics for disjunctive logic programs
- Equilibrium logic
- Logic Programming
- Minimum model semantics for logic programs with negation-as-failure
- Preferential regular path queries
- Static semantics for normal and disjunctive logic programs
- The well-founded semantics for general logic programs
- Well-founded and stationary models of logic programs
Cited in
(4)- A fixed point theorem for non-monotonic functions
- Infinity in logic and computation. International conference, ILC 2007, Cape Town, South Africa, November 3--5, 2007. Revised selected papers
- Corrigendum: On infinite computations in denotational semantics
- scientific article; zbMATH DE number 1931681 (Why is no real title available?)
This page was built for publication: The infinite-valued semantics: overview, recent results and future directions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4583316)