Sciweavers

10 search results - page 2 / 2
» Tightened Transitive Closure of Integer Addition Constraints
Sort
View
AIPS
2006
13 years 6 months ago
Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach
Reasoning on precedence relations is crucial for many planning and scheduling systems. In this paper we propose a double precedence graph where direct precedence relations are kep...
Roman Barták, Ondrej Cepek
AAAI
2000
13 years 6 months ago
DATALOG with Constraints - An Answer-Set Programming System
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
Deborah East, Miroslaw Truszczynski
CSL
2008
Springer
13 years 6 months ago
Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars
Abstract. We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by ch...
Ruzica Piskac, Viktor Kuncak
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 4 months ago
On Role Logic
We present role logic, a notation for describing properties of relational structures in shape analysis, databases, and knowledge bases. We construct role logic using the ideas of ...
Viktor Kuncak, Martin C. Rinard
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
13 years 10 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen