Conflict-driven answer set solving: From theory to practice

We introduce an approach to computing answer sets of logic programs, based on concepts successfully applied in Satisfiability (SAT) checking. The idea is to view inferences in Answer Set Programming (ASP) as unit propagation on nogoods. This provides us with a uniform constraint-based framework capt...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Artificial intelligence Ročník 187-188; s. 52 - 89
Hlavní autoři:	Gebser, Martin, Kaufmann, Benjamin, Schaub, Torsten
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Oxford Elsevier B.V 01.08.2012 Elsevier
Témata:	Algorithms Answer set programming Applied sciences Artificial intelligence Computation Computer science; control theory; systems Exact sciences and technology Expert systems Learning and adaptive systems Logic programming Logical, boolean and switching functions Nonmonotonic reasoning Programming Solvers Theoretical computing Versatility Answer set programming Nonmonotonic reasoning Logic programming Conflict resolution Competitiveness Knowledge representation Algorithmics Constraint satisfaction Inference Logical programming Circumscription Set theory Satisfiability
ISSN:	0004-3702, 1872-7921
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!