Computing constrained default extensions -- a constraint satisfaction problem

MaRDI QIDQ3639567zbMATH OpenFDO

Authors Gabriela Şerban, Mihaiela Lupea

Publication date 2 November 2009

zbMATH Keywords

backtrackingconstraint satisfaction problemdefault logicnonmonotonic reasoning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in artificial intelligence (68T27)

Recommendations

• scientific article; zbMATH DE number 5198305
• A system for computing constrained default logic extensions
• Alternative approaches to default logic
• scientific article; zbMATH DE number 5198932
• Computing default extensions. A heuristic approach

Cited in

(5)

• scientific article; zbMATH DE number 517004 (Why is no real title available?)
• A system for computing constrained default logic extensions
• scientific article; zbMATH DE number 5198305 (Why is no real title available?)
• Computing default extensions. A heuristic approach
• Sequent calculus in computing default extensions

This page was built for publication: Computing constrained default extensions -- a constraint satisfaction problem

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