725 search results - page 5 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
111
Voted
FOIKS
2008
Springer
15 years 1 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 ...
101
Voted
IJAR
2008
14 years 11 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...
92
Voted
AAAI
2000
15 years 1 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
15 years 5 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...
82
Voted
ERSHOV
2001
Springer
15 years 4 months ago
2001
Springer
