We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...
Propositional canonical Gentzen-type systems, introduced in [1], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...
Recently, Lakemeyer and Levesque proposed a logic of onlyknowing which precisely captures three forms of nonmonotonic reasoning: Moore's Autoepistemic Logic, Konolige's ...
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...