Sciweavers

150 search results - page 25 / 30
» The Stable Models of a Predicate Logic Program
Sort
View
LPKR
1997
Springer
15 years 1 months ago
Generalizing Updates: From Models to Programs
Abstract. Recently the field of theory update has seen some improvement, in what concerns model updating, by allowing updates to be specified by so-called revision programs. The ...
João Alexandre Leite, Luís Moniz Per...
ICLP
2009
Springer
15 years 10 months ago
Answer Set Programming with Constraints Using Lazy Grounding
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
Agostino Dovier, Alessandro Dal Palù, Enric...
FAC
2008
114views more  FAC 2008»
14 years 9 months ago
Specification of communicating processes: temporal logic versus refusals-based refinement
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
Gavin Lowe
TOOLS
1999
IEEE
15 years 1 months ago
Constraint Diagrams: A Step Beyond UML
The Unified Modeling Language (UML) is a set of notations for modelling object-oriented systems. It has become the de facto standard. Most of its notations are diagrammatic. An ex...
Joseph Gil, John Howse, Stuart Kent
SARA
2009
Springer
15 years 2 months ago
Rewriting Constraint Models with Metamodels
An important challenge in constraint programming is to rewrite constraint models into executable programs calculating the solutions. This phase of constraint processing may requir...
Raphaël Chenouard, Laurent Granvilliers, Rica...