725 search results - page 5 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
FOIKS
2008
Springer
13 years 9 months ago
2008
Springer
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
IJAR
2008
13 years 7 months ago
2008
This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without and with independence. We then consider g...
AAAI
2000
13 years 8 months ago
2000
In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axiom...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
We study the complexity of satisfiability for DLP+ dyn , an expressive logic introduced by Demri that allows to reason about dynamic policies. DLP+ dyn extends the logic DLPdyn of...
ERSHOV
2001
Springer
13 years 12 months ago
2001
Springer
