648 search results - page 19 / 130 » Using Criticalities as a Heuristic for Answer Set Programmin... |
129
click to vote
AAAI
2006
15 years 2 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
115
click to vote
LPNMR
2004
Springer
15 years 6 months ago
2004
Springer
This paper develops a declarative language, P-log, that combines logical and probabilistic arguments in its reasoning. Answer Set Prolog is used as the logical foundation, while c...
119
click to vote
INFORMATICALT
2011
14 years 8 months ago
2011
Estimation and modelling problems as they arise in many data analysis areas often turn out to be unstable and/or intractable by standard numerical methods. Such problems frequently...
131
Voted
PADL
2005
Springer
15 years 7 months ago
2005
Springer
We describe the design of the OLPS system, an implementation of the preferred answer set semantics for ordered logic programs. The basic algorithm we propose computes the extended ...
132
click to vote
ASP
2003
Springer
15 years 6 months ago
2003
Springer
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...