725 search results - page 17 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
121
click to vote
ECSQARU
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic mer...
115
click to vote
PPDP
2009
Springer
15 years 9 months ago
2009
Springer
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
149
click to vote
IJCAI
1997
15 years 3 months ago
1997
We propose a method of compiling circumscription into Extended Logic Programs which is widely applicable to a class of parallel circumscription as well as a class of prioritized c...
103
click to vote
ICALP
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
111
Voted
AAAI
2004
15 years 3 months ago
2004
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boo...