3856 search results - page 431 / 772 » Models for Automated Earthmoving |
166
click to vote
LPNMR
1999
Springer
15 years 11 months ago
1999
Springer
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...
202
click to vote
TPHOL
1998
IEEE
15 years 11 months ago
1998
IEEE
In this paper we illustrate the use of formal methods in the development of a benchmark application we call the Village Telephone System which is characteristic of a class of netwo...
153
click to vote
ICLP
1998
Springer
15 years 11 months ago
1998
Springer
The eld of theory update has seen some improvement, in what regards updating, by allowing desired updates to be speci ed by update programs. The updating of models is governed by ...
167
click to vote
LICS
1996
IEEE
15 years 11 months ago
1996
IEEE
Ahybrid automatonis a formalmodelfor a mixeddiscrete-continuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically...
197
click to vote
CSL
1992
Springer
15 years 10 months ago
1992
Springer
We develop the rst steps of a theory of concurrency within the framework of evolving algebras of Gurevich, with the aim of investigating its suitability for the role of a general f...