Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
Boolean formulas
Description:
Well-formed expressions in Boolean logic, composed of variables and logical operators and used in mathematics, computer science, and formal reasoning.
Related topics:
Complexity and Algorithms in Graphs (11%),
Advanced Graph Theory Research (8%)
Wikidata ID:
wiki/Q2509500
OpenAlex ID:
keywords/boolean-formulas
Data, information, knowledge and principle: back to metabolism in KEGG
2013
·
Minoru Kanehisa
, Susumu Goto
, et al.
·
Nucleic Acids Research
·
3,234
PDF
Queries and Concept Learning
1988
·
Dana Angluin
·
Machine Learning
·
1,995
PDF
Feature Models, Grammars, and Propositional Formulas
2005
·
Don Batory
·
Lecture notes in computer science
·
1,255
Symbolic model checking: an approach to the state explosion problem
1992
·
Kenneth L. McMillan
·
967
Proceedings of the fifth annual workshop on Computational learning theory
1992
·
569
Survey propagation: An algorithm for satisfiability
2005
·
A. Braunstein
, M. Mézard
, et al.
·
Random Structures and Algorithms
·
517
PDF
Computational limitations on learning from examples
1988
·
Leonard Pitt
, Leslie G. Valiant
·
Journal of the ACM
·
514
PDF
Applicability of modified condition/decision coverage to software testing
1994
·
John Joseph Chilenski
, Steven P. Miller
·
Software Engineering Journal
·
512
Minimization of Boolean complexity in human concept learning
2000
·
Jacob Feldman
·
Nature
·
494
Carry-Select Adder
1962
·
O. J. Bedrij
·
IRE Transactions on Electronic Computers
·
406
Molecular Computation by DNA Hairpin Formation
2000
·
Kensaku Sakamoto
, Hidetaka Gouzu
, et al.
·
Science
·
390
How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
2012
·
Bryan Parno
, Mariana Raykova
, et al.
·
Lecture notes in computer science
·
356
Some high level language constructs for data of type relation
1977
·
Joachim W. Schmidt
·
ACM Transactions on Database Systems
·
336
PDF
Symbolic bisimulations
1995
·
M Hennessy
, H Lin
·
Theoretical Computer Science
·
317
PDF
Complete problems for deterministic polynomial time
1976
·
Neil D. Jones
, William T. Laaser
·
Theoretical Computer Science
·
285
Feature diagrams and logics: There and back again
·
Krzysztof Czarnecki
·
270
Automatically generating test data from a Boolean specification
1994
·
E. Weyuker
, T. Goradia
, et al.
·
IEEE Transactions on Software Engineering
·
266
The Boolean formula value problem is in ALOGTIME
1987
·
S. R. Buss
·
ACM Symposium on Theory of Computing (STOC)
·
258
Solving satisfiability in less than 2n steps
1985
·
B. Monien
, E. Speckenmeyer
·
Discrete Applied Mathematics
·
257
Negative Results for Equivalence Queries
1990
·
Dana Angluin
·
Machine Learning
·
230
PDF
Extending the ATMS
1986
·
Johan de Kleer
·
Artificial Intelligence
·
223
Analysis of Two Simple Heuristics on a Random Instance ofk-sat
1996
·
Alan Frieze
, Stephen Suen
·
Journal of Algorithms
·
219
Feature Diagrams and Logics: There and Back Again
2007
·
Krzysztof Czarnecki
, Andrzej Wasowski
·
International Software Product Line Conference (SPLC)
·
190
Breaking the Circuit Size Barrier for Secure Computation Under DDH
2016
·
Elette Boyle
, Niv Gilboa
, et al.
·
Lecture notes in computer science
·
186
The complexity of the pigeonhole principle
1988
·
M. Ajtai
·
Annual Symposium on Foundations of Computer Science
·
184
Show more works
View as search
Works count:
1,803
Citation count:
29,770
Year
Topic
Type