Advances in SAT solver technology have enabled many automated analysis and reasoning tools to reduce their input problem to a SAT problem, and then to use an efficient SAT solver ...
This paper is devoted to investigate resolution for quantified generalized clause-sets (QCLS). The soundness and refutation completeness are proved. Then quantified generalized Ho...
Clark's completion is a simple nonmonotonic formalism and a special case of several nonmonotonic logics. Recently there has been work on extending completion with "loop ...
The aim of this note is to give some factorisation formulas for different versions of the Macdonald polynomials when the parameter t is specialized at roots of unity, generalizing...
Abstract. A generalized decision logic in interval-set-valued information tables is introduced, which is an extension of decision logic studied by Pawlak. Each object in an interva...