585 search results - page 17 / 117 » Strategy Logic |
117
click to vote
TIME
2009
IEEE
15 years 8 months ago
2009
IEEE
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...
146
click to vote
ASP
2005
Springer
15 years 7 months ago
2005
Springer
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
140
click to vote
FLOPS
1999
Springer
15 years 6 months ago
1999
Springer
We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. Our approach is based on a translation of these s...
105
Voted
POPL
1994
ACM
15 years 5 months ago
1994
ACM
Abstract: The narrowing relation over terms constitutes the basis of the most important operational semantics of languages that integrate functional and logic programming paradigms...
119
Voted
AAAI
2004
15 years 3 months ago
2004
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...