Sciweavers

4617 search results - page 440 / 924
» Automation of Diagrammatic Reasoning
Sort
View
ECSQARU
1997
Springer
15 years 11 months ago
Cactus: A Branching-Time Logic Programming Language
Abstract. Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear ow of ...
Panos Rondogiannis, Manolis Gergatsoulis, Themis P...
LICS
1996
IEEE
15 years 11 months ago
Higher Dimensional Transition Systems
We introduce the notion of higher dimensional transition systems as a model of concurrency providing an elementary, set-theoretic formalisation of the idea of higher dimensional t...
Gian Luca Cattani, Vladimiro Sassone
TPHOL
1996
IEEE
15 years 11 months ago
Importing Mathematics from HOL into Nuprl
Nuprl and HOL are both tactic-based interactive theorem provers for higher-order logic, and both have been used in many substantial applications over the last decade. However, the ...
Douglas J. Howe
ICLP
1997
Springer
15 years 11 months ago
Solving Small TSPs with Constraints
This paper presents a set of techniques that makes constraint programming a technique of choice for solving small (up to 30 nodes) traveling salesman problems. These techniques in...
Yves Caseau, François Laburthe
ICLP
1997
Springer
15 years 11 months ago
Hybrid Probabilistic Programs
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
Alex Dekhtyar, V. S. Subrahmanian