3446 search results - page 159 / 690 » A Reasoning Algorithm for pD* |
133
click to vote
ICLP
2001
Springer
15 years 8 months ago
2001
Springer
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...
141
click to vote
TPHOL
2000
IEEE
15 years 8 months ago
2000
IEEE
We verify within the Coq proof assistant that ML typing is sound with respect to the dynamic semantics. We prove this property in the framework of a big step semantics and also in ...
130
click to vote
KR
1992
Springer
15 years 8 months ago
1992
Springer
We describe the ucpop partial order planning algorithm which handles a subset of Pednault's ADL action representation. In particular, ucpop operates with actions that have co...
148
click to vote
ECAI
1998
Springer
15 years 8 months ago
1998
Springer
We present probabilistic logic programming under inheritance with overriding. This approach is based on new notions of entailment for reasoning with conditional constraints, which...
111
click to vote
FLOPS
2006
Springer
15 years 7 months ago
2006
Springer
We propose a new method to control memory resources by static analysis. For this, we introduce the notion of sup-interpretation which bounds from above the size of function outputs...