1353 search results - page 103 / 271 » Streamlined Constraint Reasoning |
CADE
2006
Springer
14 years 10 months ago
2006
Springer
It is well-known that the connection refinement of clause tableaux with paramodulation is incomplete (even with weak connections). In this paper, we present a new connection tablea...
CADE
2004
Springer
14 years 10 months ago
2004
Springer
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...
ISPD
2009
ACM
14 years 5 months ago
2009
ACM
The design of analog circuits has historically been a time consuming, manual task. The stringent constraints that must be considered simultaneously make the task particularly diff...
CADE
1998
Springer
14 years 2 months ago
1998
Springer
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...
LPAR
1992
Springer
14 years 2 months ago
1992
Springer
We describe some of the techniques which have been used to implement METATEM, a programming language based on temporal logic, and address problems such as non-determinism and loopi...