226 search results - page 6 / 46 » GAC on Conjunctions of Constraints |
IGPL
2006
13 years 7 months ago
2006
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
CLEIEJ
2006
13 years 7 months ago
2006
This paper presents a solution to check referential integrity constraints and conjunctive global constraints in a relational multi database system. It also presents the experiment...
SAS
2004
Springer
14 years 28 days ago
2004
Springer
Role logic is a notation for describing properties of relational structures in shape analysis, databases and knowledge bases. A natural fragment of role logic corresponds to two-va...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We have previously introduced role logic as a notation for describing properties of relational structures in shape analysis, databases and knowledge bases. A natural fragment of ro...
VLSID
2007
IEEE
14 years 8 months ago
2007
IEEE
Boolean Satisfiability is seeing increasing use as a decision procedure in Electronic Design Automation (EDA) and other domains. Most applications encode their domain specific cons...