846 search results - page 77 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
102
Voted
LPNMR
1997
Springer
15 years 4 months ago
1997
Springer
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...
116
click to vote
IICAI
2007
15 years 2 months ago
2007
Logics of action, for reasoning about the effects of state change, and logics of belief, accounting for belief revision and update, have much in common. Furthermore, we may underta...
193
Voted
AGP
2010
IEEE
15 years 5 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
127
Voted
WOLLIC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We present a modal language that includes explicit operators to count the number of elements that a model might include in the extension of a formula, and we discuss how ...
106
Voted
POPL
1994
ACM
15 years 4 months ago
1994
ACM
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...