2911 search results - page 285 / 583 » A Logic of Graph Constraints |
192
click to vote
AIPS
2003
15 years 8 months ago
2003
Symmetries are inherent in systems that consist of several interchangeable objects or components. When reasoning about such systems, big computational savings can be obtained if t...
202
click to vote
CADE
2010
Springer
15 years 7 months ago
2010
Springer
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
179
click to vote
CSL
2009
Springer
15 years 10 months ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
204
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
242
click to vote
SOFSEM
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Constraint Handling Rules (CHR) is a general purpose, committedchoice declarative language which, differently from other similar languages, uses multi-headed (guarded) ru...