Stable inference as intuitionistic validity

DOI10.1016/S0743-1066(98)10015-8zbMath0911.68136OpenAlexW2028582842MaRDI QIDQ4223455

No author found.

Publication date: 3 January 1999

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0743-1066(98)10015-8

zbMATH Keywords

stable model semanticsnonmonotonic inference relation

Mathematics Subject Classification ID

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

Related Items (16)

An extension of the stable semantics via Lukasiewicz logic ⋮ Equilibrium logic ⋮ First-order Answer Set Programming as Constructive Proof Search ⋮ Model-based recasting in answer-set programming ⋮ Answer set programming in intuitionistic logic ⋮ Fidel Semantics for Propositional and First-Order Version of the Logic of CG’3 ⋮ Inconsistency Proofs for ASP: The ASP - DRUPE Format ⋮ On the limits of forgetting in answer set programming ⋮ A logical approach to A-Prolog ⋮ Equivalence for the \(G_3^\prime\)-stable models semantics ⋮ Safe beliefs for propositional theories ⋮ Modality Argumentation Programming ⋮ A tableaux calculus for default intuitionistic logic ⋮ Brief study of G'₃ logic ⋮ Semantics for Possibilistic Disjunctive Programs ⋮ Possibilistic nested logic programs and strong equivalence

This page was built for publication: Stable inference as intuitionistic validity