Tight semantics for logic programs

DOI10.4230/LIPICS.ICLP.2010.134zbMATH Open1237.68048OpenAlexW1534321109MaRDI QIDQ2883086FDOQ2883086

Authors: Luís Moniz Pereira, Alexandre Pinto 

Publication date: 11 May 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_fa61.html

Recommendations

• Tight logic programs
• Tight, consistent, and computable completions for unrestricted logic programs
• A tutorial on the well-founded semantics
• On the declarative and procedural semantics of logic programs
• Negation as failure using tight derivations for general logic programs

zbMATH Keywords

relevancestable modelswell-founded semanticsnormal logic programscumulativityprogram remainder

Mathematics Subject Classification ID

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

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Approved Models for Normal Logic Programs
• Tight, consistent, and computable completions for unrestricted logic programs
• Tight logic programs
• Strict completion of logic programs

This page was built for publication: Tight semantics for logic programs

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