Add to ORKGWe propose in this article a translation from Quantified Boolean Formulae to Answer Set Programming. The computation of a solution of a Quantified Boolean Formula is then equivalent to the computation of a stable model for a normal logic program. The case of unquantified Boolean formulae is also considered since it is equivalent to the case of Quantified Boolean Formulae with only existential quantifiers
© 2016 Cambridge University Press. Standard answer set programming (ASP) targets at solving search p...
AbstractWe propose a new translation from normal logic programs with constraints under the answer se...
AbstractWe propose a new translation from normal logic programs with constraints under the answer se...
We propose in this article a translation from quantified Boolean formulae to answer set programming....
International audienceWe propose in this article a translation from quantified Boolean formulae to a...
This paper proposes a new set of propagation rules for quantified Boolean formulae based on literals...
We present a theorem-prover for quantified Boolean formulae and evaluate it on random quantified f...
In this paper we present an alternative approach to formalize the theory of logic programming. In th...
We introduce the notion of Boolean programs, which provide more concise de-scriptions of Boolean fun...
Answer set programming (ASP) is a method for solving hard problems using computational logic. We des...
We propose a new translation from normal logic programs with constraints under the answer set semant...
In this paper we introduce a simple way to evaluate epistemic logic programs by means of answer set ...
In this paper we approach the problem of reasoning with quantified Boolean formulas (QBFs) by comb...
Answer set programming (ASP) is a method for solving hard problems using computational logic. We des...
Abstract. In recent work, a general framework for specifying program correspondences under the answe...
© 2016 Cambridge University Press. Standard answer set programming (ASP) targets at solving search p...
AbstractWe propose a new translation from normal logic programs with constraints under the answer se...
AbstractWe propose a new translation from normal logic programs with constraints under the answer se...
We propose in this article a translation from quantified Boolean formulae to answer set programming....
International audienceWe propose in this article a translation from quantified Boolean formulae to a...
This paper proposes a new set of propagation rules for quantified Boolean formulae based on literals...
We present a theorem-prover for quantified Boolean formulae and evaluate it on random quantified f...
In this paper we present an alternative approach to formalize the theory of logic programming. In th...
We introduce the notion of Boolean programs, which provide more concise de-scriptions of Boolean fun...
Answer set programming (ASP) is a method for solving hard problems using computational logic. We des...
We propose a new translation from normal logic programs with constraints under the answer set semant...
In this paper we introduce a simple way to evaluate epistemic logic programs by means of answer set ...
In this paper we approach the problem of reasoning with quantified Boolean formulas (QBFs) by comb...
Answer set programming (ASP) is a method for solving hard problems using computational logic. We des...
Abstract. In recent work, a general framework for specifying program correspondences under the answe...
© 2016 Cambridge University Press. Standard answer set programming (ASP) targets at solving search p...
AbstractWe propose a new translation from normal logic programs with constraints under the answer se...
AbstractWe propose a new translation from normal logic programs with constraints under the answer se...