725 search results - page 23 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
127
click to vote
NMR
2004
Springer
15 years 7 months ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
109
click to vote
LPNMR
2009
Springer
15 years 9 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
SAC
2006
ACM
15 years 8 months ago
2006
ACM
138
click to vote
ENTCS
2006
15 years 2 months ago
2006
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
119
click to vote
UAI
1993
15 years 3 months ago
1993
In this paper the classical propositional assumption-based model is extended to incorporate probabilities for the assumptions. Then the whole model is placed into the framework of...