Results 1 - 10 of 98,064

Boolean Formulae

by Lucas Bordeaux, Marco Cadoli, Università Di Roma “la Sapienza, Toni Mancini, Authors’address Lucas Bordeaux, Roger Needham Building, J J Thomson
"... Quantified constraints and Quantified Boolean Formulae are typically much more difficult to reason with than classical constraints, because quantifier alternation makes the usual notion of solution inappropriate. As a consequence, basic properties of Constraint Satisfaction Problems (CSP), such as c ..."
Abstract - Add to MetaCart
Quantified constraints and Quantified Boolean Formulae are typically much more difficult to reason with than classical constraints, because quantifier alternation makes the usual notion of solution inappropriate. As a consequence, basic properties of Constraint Satisfaction Problems (CSP

Boolean formula?

by Jin-yi Cai, Pinyan Lu
"... #SAT: How many satisfying assignments are there in a ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
#SAT: How many satisfying assignments are there in a

◦ Boolean formulas

by Ruben Martins
"... How to encode a problem into SAT? c famous problem (in CNF) p cnf 6 9 1 4 0 ..."
Abstract - Add to MetaCart
How to encode a problem into SAT? c famous problem (in CNF) p cnf 6 9 1 4 0

Learning Boolean Formulae

by Michael Kearns, Ming Li , Leslie Valiant
"... ..."
Abstract - Cited by 182 (19 self) - Add to MetaCart
Abstract not found

Cryptographic Limitations on Learning Boolean Formulae and Finite Automata

by Michael Kearns, Leslie Valiant - PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING , 1989
"... In this paper we prove the intractability of learning several classes of Boolean functions in the distribution-free model (also called the Probably Approximately Correct or PAC model) of learning from examples. These results are representation independent, in that they hold regardless of the syntact ..."
Abstract - Cited by 347 (15 self) - Add to MetaCart
of the syntactic form in which the learner chooses to represent its hypotheses. Our methods reduce the problems of cracking a number of well-known public-key cryptosystems to the learning problems. We prove that a polynomial-time learning algorithm for Boolean formulae, deterministic finite automata or constant

Weighted boolean formula games

by Marios Mavronicolas, Burkhard Monien, Klaus W. Wagner - In Proceedings of the 3rd International Workshop on Internet and Network Economics (WINE , 2007
"... We introduce a new class of succinct games, called weighted boolean formula games. Here, each player has a set of boolean formulas he wants to get satisfied. The boolean formulas of all players involve a ground set of boolean variables, and every player controls some of these variables. The payoff o ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
We introduce a new class of succinct games, called weighted boolean formula games. Here, each player has a set of boolean formulas he wants to get satisfied. The boolean formulas of all players involve a ground set of boolean variables, and every player controls some of these variables. The payoff

The Boolean formula value problem

by unknown authors , 1987
"... Abstract The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish notation Boolean formulas is also in alternating log time. These results are optimal since the Boolean formula v ..."
Abstract - Add to MetaCart
Abstract The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish notation Boolean formulas is also in alternating log time. These results are optimal since the Boolean formula

The Boolean formula value problem is in ALOGTIME

by Samuel R. Buss - in Proceedings of the 19-th Annual ACM Symposium on Theory of Computing , 1987
"... The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish notation Boolean formulas is also in alternating log time. These results are optimal since the Boolean formula value ..."
Abstract - Cited by 80 (7 self) - Add to MetaCart
The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish notation Boolean formulas is also in alternating log time. These results are optimal since the Boolean formula value

Automated reencoding of boolean formulas

by Norbert Manthey, Marijn J. H. Heule, Armin Biere - In Proceedings of Haifa Verification Conference , 2012
"... Abstract. We present a novel preprocessing technique to automatically reduce the size of Boolean formulas. This technique, called Bounded Variable Addition (BVA), exchanges clauses for variables. Similar to other preprocessing techniques, BVA greedily lowers the sum of variables and clauses, a rough ..."
Abstract - Cited by 6 (5 self) - Add to MetaCart
Abstract. We present a novel preprocessing technique to automatically reduce the size of Boolean formulas. This technique, called Bounded Variable Addition (BVA), exchanges clauses for variables. Similar to other preprocessing techniques, BVA greedily lowers the sum of variables and clauses, a

ON THE ORTHOGONALIZATION OF ARBITRARY BOOLEAN FORMULAE

by Renato Bruni , 2004
"... The orthogonal conjunctive normal form of a Boolean function is a conjunctive normal form in which any two clauses contain at least a pair of complementary literals. Orthog-onal disjunctive normal form is defined similarly. Orthogonalization is the process of transforming the normal form of a Boolea ..."
Abstract - Add to MetaCart
general proce-dure for transforming an arbitrary CNF or DNF to an orthogonal one is proposed. Such procedure is tested on randomly generated Boolean formulae. 1.
Results 1 - 10 of 98,064