2911 search results - page 197 / 583 » A Logic of Graph Constraints |
214
click to vote
FUIN
2007
15 years 6 months ago
2007
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
177
click to vote
SIMPRA
2008
15 years 6 months ago
2008
This paper addresses the problem of verifying the discrete control logic that is typically implemented by programmable controllers. Not only are the logical properties of the cont...
171
click to vote
ICLP
1997
Springer
15 years 11 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
209
click to vote
ICDE
1992
IEEE
15 years 11 months ago
1992
IEEE
Contrary to popular belief, relation schemes in good classical normal forms are not necessarily devoid of redundancies. This arises from the fact that classical data dependencies ...
169
click to vote
AIPS
1998
15 years 8 months ago
1998
Casting planning problems as propositional satis ability problems has recently been shown to be an effective way of scaling up plan synthesis. Until now, the bene ts of this appro...