Approved Models for Normal Logic Programs

DOI10.1007/978-3-540-75560-9_33zbMATH Open1137.68340DBLPconf/lpar/PereiraP07OpenAlexW1600077456WikidataQ62038950 ScholiaQ62038950MaRDI QIDQ3498486FDOQ3498486

Authors: Luís Moniz Pereira, Alexandre Pinto 

Publication date: 15 May 2008

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75560-9_33

Recommendations

• Disjunctive \(LP+\) integrity constraints = stable model semantics.
• Short note preferred extensions are partial stable models
• On the equivalence of semantics for normal logic programs
• scientific article; zbMATH DE number 1114052
• Tight semantics for logic programs

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• Dualities between alternative semantics for logic programming and nonmonotonic reasoning
• An abstract, argumentation-theoretic approach to default reasoning
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Dialectic proof procedures for assumption-based, admissible argumentation
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Semi-equilibrium models for paracoherent answer set programs
• Paracoherent answer set semantics meets argumentation frameworks
• Better paracoherent answer sets with less resources
• Paracoherent answer set computation
• Modular paracoherent answer sets
• Collaborative vs. Conflicting Learning, Evolution and Argumentation

This page was built for publication: Approved Models for Normal Logic Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3498486)