Sciweavers

254 search results - page 6 / 51
» Answer Sets for Propositional Theories
Sort
View
ASP
2003
Springer
14 years 28 days ago
Implementing OCLP as a front-end for Answer Set Solvers: From Theory to Practice
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives and without the burden of any form of negation. This complet...
Martin Brain, Marina De Vos
RR
2010
Springer
13 years 6 months ago
Defeasibility in Answer Set Programs via Argumentation Theories
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
Hui Wan, Michael Kifer, Benjamin N. Grosof
ICLP
2009
Springer
14 years 8 months ago
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
Miroslaw Truszczynski
ASP
2005
Springer
14 years 1 months ago
An Experimental Study of Search Strategies and Heuristics in Answer Set Programming
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
Enrico Giunchiglia, Marco Maratea