Sciweavers

120 search results - page 15 / 24
» First Order Logic with Domain Conditions
Sort
View
AUSAI
2007
Springer
15 years 5 months ago
Planning as Satisfiability with Relaxed $-Step Plans
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...
Martin Wehrle, Jussi Rintanen
112
Voted
AAAI
1994
15 years 3 months ago
On the Inherent Level of Local Consistency in Constraint Networks
We present a new property called constraint looseness and show how it can be used to estimate the level of local consistency of a binary constraint network. Speci cally, we presen...
Peter van Beek
TC
2010
15 years 6 days ago
Formal Reliability Analysis Using Theorem Proving
—Reliability analysis has become a tool of fundamental importance to virtually all electrical and computer engineers because of the extensive usage of hardware systems in safety ...
Osman Hasan, Sofiène Tahar, Naeem Abbasi
143
Voted
JELIA
2010
Springer
14 years 11 months ago
Tabling with Answer Subsumption: Implementation, Applications and Performance
Tabled Logic Programming (TLP) is becoming widely available in Prolog systems, but most implementations of TLP implement only answer variance in which an answer A is added to the t...
Terrance Swift, David Scott Warren
120
Voted
ECAI
2004
Springer
15 years 7 months ago
Guiding a Theorem Prover with Soft Constraints
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
John K. Slaney, Arnold Binas, David Price