846 search results - page 92 / 170 » Rewrite-Based Decision Procedures |
149
Voted
HASE
1998
IEEE
15 years 10 months ago
1998
IEEE
An important practical problem in fault diagnosis is discriminating between permanent faults and transient faults. In many computer systems, the majority of errors are due to tran...
143
Voted
KR
1992
Springer
15 years 10 months ago
1992
Springer
In this paper, we view planning as a special case of reasoning about indefinite actions. We treat actions as predicates defined over a linear temporal order. This formalism permit...
166
Voted
RTA
2010
Springer
15 years 10 months ago
2010
Springer
Infinitary Term Rewriting allows to express infinitary terms and infinitary reductions that converge to them. As their notion of transfinite reduction in general, and as binary...
152
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
This paper introduces a new design methodology (we call it "innovization") in the context of finding new and innovative design principles by means of optimization techni...
167
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...