4117 search results - page 572 / 824 » On the Satisfiability of Complex Constraints |
161
click to vote
ACL
1998
15 years 8 months ago
1998
Since the early Sixties and Seventies it has been known that the regular and context-free languages arc characterized by definability in the monadic second-order theory of certain...
161
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...
200
click to vote
AAAI
1993
15 years 8 months ago
1993
Many reported discovery systems build discrete models of hidden structure, properties, or processes in the diverse fields of biology, chemistry, and physics. We show that the sear...
146
Voted
AIPS
1994
15 years 8 months ago
1994
This paper describes work on the Multimission VICARPlanner (MVP) system to automatically construct executable imageprocessing procedures for custom image processing requests for t...
200
click to vote
AAAI
1992
15 years 8 months ago
1992
Effective problem-solving about complex engineered devices requires device models that are both adequate for the problem and computationally efficient . Producing such models requ...