Sciweavers

2911 search results - page 103 / 583
» A Logic of Graph Constraints
Sort
View
CORR
1998
Springer
126views Education» more  CORR 1998»
15 years 8 days ago
Stable models and an alternative logic programming paradigm
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
Victor W. Marek, Miroslaw Truszczynski
98
Voted
SBACPAD
2003
IEEE
125views Hardware» more  SBACPAD 2003»
15 years 5 months ago
Applying Scheduling by Edge Reversal to Constraint Partitioning
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
Marluce Rodrigues Pereira, Patrícia Kayser ...
123
Voted
VL
2003
IEEE
146views Visual Languages» more  VL 2003»
15 years 5 months ago
A reading algorithm for constraint diagrams
Constraint diagrams are a visual notation designed to complement the Unified Modeling Language in the development of software systems. They generalize Venn diagrams and Euler cir...
Andrew Fish, Jean Flower, John Howse
113
Voted
DIAGRAMS
2004
Springer
15 years 4 months ago
Towards a Default Reading for Constraint Diagrams
Constraint diagrams are a diagrammatic notation which may be used to express logical constraints. They were designed to complement the Unified Modeling Language in the development ...
Andrew Fish, John Howse
SLP
1993
117views more  SLP 1993»
15 years 1 months ago
Boolean Constraint Solving Using clp(FD)
We present a boolean constraint logic language clp(B/FD) built upon a language over finite domains clp(FD) which uses a local propagation constraint solver. It is based on a sing...
Philippe Codognet, Daniel Diaz