Results 1  10
of
97,394
Encoding Quantified CSPs as Quantified Boolean Formulae
 In Proceedings of ECAI2004
, 2004
"... Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to set the remaining, existentially quantified, variables so that the constraints are all satisfied. Interest in this topic ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
in this topic is increasing following recent advances in Quantified Boolean Formulae (QBFs), the analogous generalisation of satisfiability (SAT). We show that we can encode QCSPs as QBFs. We introduce a simple generalisation of the direct encoding of CSPs into SAT. We then introduce some adaptations
On Quantifier Shifting for Quantified Boolean Formulas
 IN PROCEEDINGS OF THE SAT02 WORKSHOP ON THEORY AND APPLICATIONS OF QUANTIFIED BOOLEAN FORMULAS (QBF02
, 2002
"... Since most currently available solvers for quantified Boolean formulas (QBFs) process only input formulas in prenex normal form, suitable translations are required for handling arbitrary formulas. In this paper, we propose a normal form translation incorporating a certain antiprenexing step in o ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Since most currently available solvers for quantified Boolean formulas (QBFs) process only input formulas in prenex normal form, suitable translations are required for handling arbitrary formulas. In this paper, we propose a normal form translation incorporating a certain antiprenexing step
Repairbased methods for quantified CSPs
 In CP
, 2005
"... Abstract. The Quantified CSP (QCSP) is a generalization of the CSP which allows for universally quantified variables. For each possible sequence of assignments to such variables, we have to find a way to set the values of the remaining, existentially quantified, variables so that all the constraints ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
; the encoding of QCSPs into QBF, and the generalization of wellknown search procedures for CSPs, like FC and MAC, to the quantified case. In this paper we introduce a new approach which utilizes repairbased techniques. We describe a framework for a QCSP solver in which complete and incomplete repair
Near Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
, 2004
"... Suppose we are given a vector f in RN. How many linear measurements do we need to make about f to be able to recover f to within precision ɛ in the Euclidean (ℓ2) metric? Or more exactly, suppose we are interested in a class F of such objects— discrete digital signals, images, etc; how many linear m ..."
Abstract

Cited by 1513 (20 self)
 Add to MetaCart
Suppose we are given a vector f in RN. How many linear measurements do we need to make about f to be able to recover f to within precision ɛ in the Euclidean (ℓ2) metric? Or more exactly, suppose we are interested in a class F of such objects— discrete digital signals, images, etc; how many linear measurements do we need to recover objects from this class to within accuracy ɛ? This paper shows that if the objects of interest are sparse or compressible in the sense that the reordered entries of a signal f ∈ F decay like a powerlaw (or if the coefficient sequence of f in a fixed basis decays like a powerlaw), then it is possible to reconstruct f to within very high accuracy from a small number of random measurements. typical result is as follows: we rearrange the entries of f (or its coefficients in a fixed basis) in decreasing order of magnitude f  (1) ≥ f  (2) ≥... ≥ f  (N), and define the weakℓp ball as the class F of those elements whose entries obey the power decay law f  (n) ≤ C · n −1/p. We take measurements 〈f, Xk〉, k = 1,..., K, where the Xk are Ndimensional Gaussian
Improvements to the evaluation of quantified Boolean formulae
 In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI'99), July 31August 6
, 1999
"... We present a theoremprover for quantified Boolean formulae and evaluate it on random quantified formulae and formulae that represent problems from automated planning. Even though the notion of quantified Boolean formula is theoretically important, automated reasoning with QBF has not been thoroughl ..."
Abstract

Cited by 78 (3 self)
 Add to MetaCart
We present a theoremprover for quantified Boolean formulae and evaluate it on random quantified formulae and formulae that represent problems from automated planning. Even though the notion of quantified Boolean formula is theoretically important, automated reasoning with QBF has not been
Algorithms for Quantified Boolean Formulas
, 2002
"... We present algorithms for solving quantified Boolean formulas (QBF, or sometimes QSAT) with worst case runtime asymptotically less than O(2^n) when the clausetovariable ratio is smaller or larger than some constant. We solve QBFs in conjunctive normal form (CNF) in O(1.709^m) time and space, where ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
We present algorithms for solving quantified Boolean formulas (QBF, or sometimes QSAT) with worst case runtime asymptotically less than O(2^n) when the clausetovariable ratio is smaller or larger than some constant. We solve QBFs in conjunctive normal form (CNF) in O(1.709^m) time and space
Alternatingtime Temporal Logic
 Journal of the ACM
, 1997
"... Temporal logic comes in two varieties: lineartime temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branchingtime temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general var ..."
Abstract

Cited by 615 (55 self)
 Add to MetaCart
for closed systems, alternatingtime logics are natural specification languages for open systems. For example, by preceding the temporal operator "eventually" with a selective path quantifier, we can specify that in the game between the system and the environment, the system has a strategy to reach
UCPOP: A Sound, Complete, Partial Order Planner for ADL
, 1992
"... We describe the ucpop partial order planning algorithm which handles a subset of Pednault's ADL action representation. In particular, ucpop operates with actions that have conditional effects, universally quantified preconditions and effects, and with universally quantified goals. We prove ucpo ..."
Abstract

Cited by 491 (24 self)
 Add to MetaCart
We describe the ucpop partial order planning algorithm which handles a subset of Pednault's ADL action representation. In particular, ucpop operates with actions that have conditional effects, universally quantified preconditions and effects, and with universally quantified goals. We prove
Some informational aspects of visual perception
 Psychol. Rev
, 1954
"... The ideas of information theory are at present stimulating many different areas of psychological inquiry. In providing techniques for quantifying situations which have hitherto been difficult or impossible to quantify, they suggest new and more precise ways of conceptualizing these situations (see M ..."
Abstract

Cited by 628 (2 self)
 Add to MetaCart
The ideas of information theory are at present stimulating many different areas of psychological inquiry. In providing techniques for quantifying situations which have hitherto been difficult or impossible to quantify, they suggest new and more precise ways of conceptualizing these situations (see
Solving Quantified Boolean Formulas
, 2008
"... Many realworld problems do not have a simple algorithmic solution and casting these problems as search problems is often not only the simplest way of casting them, but also the most efficient way of solving them. In this thesis we will present several techniques to advance searchbased algorithms i ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
in the context of solving quantified boolean formulas (QBF). QBF enables complex realworld problems including planning, twoplayer games and verification to be captured in a compact and quite natural fashion. We will discuss techniques ranging from straight forward preprocessing methods utilizing strong rules
Results 1  10
of
97,394