933 search results - page 63 / 187 » Extending Forward Checking |
JAIR
2000
15 years 15 days ago
2000
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
165
click to vote
HIS
2009
14 years 10 months ago
2009
Recent years have witnessed the wide recognition of the importance of ontology and rule in the AI research. In this paper, we report our implementation and evaluation of a rule-ba...
102
click to vote
ENTCS
2006
15 years 22 days ago
2006
We propose a format of predicate diagrams for the verification of real-time systems. We consider systems that are defined as extended timed graphs, a format that combines timed au...
94
Voted
COMPULOG
1999
Springer
15 years 5 months ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
91
Voted
SIGSOFT
2005
ACM
16 years 1 months ago
2005
ACM
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-b...