LPAR
2001
Springer
13 years 9 months ago
2001
Springer
When writing a constraint program, we have to decide what to make the decision variable, and how to represent the constraints on these variables. In many cases, there is considerab...
LPAR
2001
Springer
13 years 9 months ago
2001
Springer
When it comes to building robot controllers, highlevel programming arises as a feasible alternative to planning. The task then is to verify a high-level program by finding a lega...
LPAR
2001
Springer
13 years 9 months ago
2001
Springer
LPAR
2001
Springer
13 years 9 months ago
2001
Springer
The EPGY Theorem-Proving Environment is designed to help students write ordinary mathematical proofs. The system, used in a selection of computer-based proof-intensive mathematics ...
LPAR
2001
Springer
13 years 9 months ago
2001
Springer
LPAR
2001
Springer
13 years 9 months ago
2001
Springer
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalizes traditional termination analysis where an analyzer tries to veri...
LPAR
2001
Springer
13 years 9 months ago
2001
Springer
A simple model of dynamic databases is studied from a modal logic perspecitve. A state α of a database is an atomic update of a state β if at most one atomic statement is evaluat...
LPAR
2001
Springer
13 years 9 months ago
2001
Springer
LPAR
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in t...
LPAR
2001
Springer
13 years 9 months ago
2001
Springer
