97 search results - page 16 / 20 » A Generalized Gelfond-Lifschitz Transformation for Logic Pro... |
POPL
1998
ACM
13 years 11 months ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
CADE
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
KI
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. We aim to demonstrate that automated deduction techniques, in particular those following the model computation paradigm, are very well suited for database schema/query re...
ICLP
2005
Springer
14 years 27 days ago
2005
Springer
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
MIDDLEWARE
2007
Springer
14 years 1 months ago
2007
Springer
This paper is about a novel rule-based approach for reasoning about qualitative spatiotemporal relations among technology-rich autonomous objects, to which we refer to as artifact...