804 search results - page 88 / 161 » On the Termination of the Chase Algorithm |
128
Voted
CAV
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. CirCUs is a satisfiability solver that works on a combination of AndInverter-Graph, CNF clauses, and BDDs. It has been designed to work well with bounded model checking. ...
87
Voted
WDAG
2000
Springer
15 years 4 months ago
2000
Springer
This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characte...
152
click to vote
DAC
1994
ACM
15 years 4 months ago
1994
ACM
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...
83
Voted
AIPS
2010
15 years 2 months ago
2010
The utility of including loops in plans has been long recognized by the planning community. Loops in a plan help increase both its applicability and the compactness of representat...
108
Voted
DLOG
2008
15 years 2 months ago
2008
The use of Description Logic as the basis for Semantic Web Languages has led to new requirements with respect to scalable and nonstandard reasoning. In this paper, we address the p...