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...
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...
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...
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...