874 search results - page 11 / 175 » Computing Weighted Solutions in Answer Set Programming |
KSEM
2010
Springer
13 years 8 months ago
2010
Springer
We examine the practicality for a user of using Answer Set Programming (ASP) for representing logical formalisms. Our example is a formalism aiming at capturing causal explanation...
ENC
2008
IEEE
14 years 4 months ago
2008
IEEE
In many fields of automated information processing it becomes crucial to consider together imprecise, uncertain or inconsistent information. Argumentation theory is a suitable fr...
AAAI
2012
12 years 23 days ago
2012
Temporal Action Logics (TAL) is a class of temporal logics for reasoning about actions. We present a reformulation of TAL in Answer Set Programming (ASP), and discuss some synergi...
ICLP
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We provide a general and modular framework for describing inferences in Answer Set Programming (ASP) that aims at an easy incorporation of additional language constructs....
NMR
2004
Springer
14 years 3 months ago
2004
Springer
We develop an Answer Set Programming formalism based on Default Logic. We show that computing generating sets of extensions in this formalism captures all ΣP 2 search problems.