Sciweavers

1117 search results - page 114 / 224
» Partial Models of Extended Generalized Logic Programs
Sort
View
TIME
2008
IEEE
15 years 7 months ago
Moving Spaces
Boolean contact algebras constitute a convenient approach to a region based theory of space. In this paper we want to extend this approach to regions moving in time - called timed...
Ivo Düntsch, Michael Winter
TPHOL
1999
IEEE
15 years 5 months ago
Lifted-FL: A Pragmatic Implementation of Combined Model Checking and Theorem Proving
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...
Mark Aagaard, Robert B. Jones, Carl-Johan H. Seger
LOGCOM
2010
128views more  LOGCOM 2010»
14 years 12 months ago
Answer Set Programming with Resources
In this paper, we propose an extension of Answer Set Programming (ASP) to support declarative reasoning on consumption and production of resources. We call the proposed extension ...
Stefania Costantini, Andrea Formisano
C++
1992
83views more  C++ 1992»
15 years 2 months ago
Adding Concurrency to a Programming Language
A programming language that lacks facilities for concurrent programming can gain those facilities in two ways: the language can be extended with additional constructs, which will ...
Peter A. Buhr, G. Ditchfeld
SIGSOFT
2003
ACM
15 years 6 months ago
Fluent model checking for event-based systems
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
Dimitra Giannakopoulou, Jeff Magee