Sciweavers

4 search results - page 1 / 1
» A Resolution Calculus with Shared Literals
Sort
View
FUIN
2007
90views more  FUIN 2007»
13 years 4 months ago
A Resolution Calculus with Shared Literals
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
Nicolas Peltier
ESSLLI
1999
Springer
13 years 8 months ago
Weak Equivalence in Propositional Calculus
Abstract. The main purpose of this paper is to present a new algorithm (NEWSAT) for deciding the (un)satisfiability of propositional formulae. It is based on a somehow dual (versu...
Stefan Andrei
SAT
2009
Springer
119views Hardware» more  SAT 2009»
13 years 11 months ago
Boundary Points and Resolution
We use the notion of boundary points to study resolution proofs. Given a CNF formula F, a lit(x)-boundary point is a complete assignment falsifying only clauses of F having the sam...
Eugene Goldberg
ATAL
2010
Springer
13 years 5 months ago
Agreeing on plans through iterated disputes
Autonomous agents transcend their individual capabilities by cooperating towards achieving shared goals. The different viewpoints agents have on the environment cause disagreement...
Alexandros Belesiotis, Michael Rovatsos, Iyad Rahw...