504 search results - page 63 / 101 » The Complexity of Symmetry-Breaking Formulas |
LICS
1999
IEEE
14 years 2 months ago
1999
IEEE
We give a new decision procedure for the guarded fragment with equality. The procedure is based on resolution with superposition. We argue that this method will be more useful in ...
WG
1998
Springer
14 years 2 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
VLDB
1993
ACM
14 years 2 months ago
1993
ACM
The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reduci...
COCO
2006
Springer
14 years 1 months ago
2006
Springer
We consider the relationship between the complexities of - and those of restricted to formulas of constant density. Let be the infimum of those such that - on variables can be dec...
ATAL
2003
Springer
14 years 1 months ago
2003
Springer
One of the factors holding back the application of multiagent, distributed approaches to large-scale sensor interpretation and diagnosis problems is the lack of good techniques fo...