Search results for "CNF"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
10	Dimitris Achlioptas, Paul Beame, Michael Molloy 0001	Exponential bounds for DPLL below the satisfiability threshold.	SODA	2004	DBLP BibTeX RDF
10	Bin Li, Michael S. Hsiao, Shuo Sheng	A Novel SAT All-Solutions Solver for Efficient Preimage Computation.	DATE	2004	DBLP DOI BibTeX RDF
10	Stephen A. Cook, Antonina Kolokolova	A Second-Order Theory for NL.	LICS	2004	DBLP DOI BibTeX RDF
10	Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano	On NC1 Boolean Circuit Composition of Non-interactive Perfect Zero-Knowledge.	MFCS	2004	DBLP DOI BibTeX RDF
10	Evgeny Dantsin, Alexander Wolpert	Derandomization of Schuler's Algorithm for SAT.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
10	Armin Biere	Resolve and Expand.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
10	Malay K. Ganai, Aarti Gupta, Pranav Ashar	Efficient SAT-based unbounded symbolic model checking using circuit cofactoring.	ICCAD	2004	DBLP DOI BibTeX RDF
10	Jan Johannsen	Satisfiability Problems Complete for Deterministic Logarithmic Space.	STACS	2004	DBLP DOI BibTeX RDF
10	Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A. Junttila	Simple Bounded LTL Model Checking.	FMCAD	2004	DBLP DOI BibTeX RDF	linear translation, bounded model checking, LTL, NuSMV
10	Nicola Galesi, Neil Thapen	The Complexity of Treelike Systems over lamda-Local Formulae.	CCC	2004	DBLP DOI BibTeX RDF
10	Pece V. Gorsevski, Paul E. Gessler, Piotr Jankowski	Integrating a fuzzy k-means classification and a Bayesian approach for spatial prediction of landslide hazard.	J. Geogr. Syst.	2003	DBLP DOI BibTeX RDF	landslide hazard, modeling, Bayes theorem, fuzzy k-means
10	Edward Y. Chang, Beitao Li	MEGA - the maximizing expected generalization algorithm for learning complex query concepts.	ACM Trans. Inf. Syst.	2003	DBLP DOI BibTeX RDF	data mining, relevance feedback, Active learning, query concept
10	Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah	Solving difficult instances of Boolean satisfiability in the presence of symmetry.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2003	DBLP DOI BibTeX RDF
10	Vikraman Arvind, Rainer Schuler	The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems.	ISAAC	2003	DBLP DOI BibTeX RDF
10	Thomas Eiter, Kazuhisa Makino	Abduction and the Dualization Problem.	Discovery Science	2003	DBLP DOI BibTeX RDF	monotone dualization, Horn functions, polynomial total-time computation, NP-hardness, Abduction, model-based reasoning, hypergraph transversals
10	Josh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi	Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua.	FOCS	2003	DBLP DOI BibTeX RDF
10	Guanghui Li 0001, Ming Shao, Xiaowei Li 0001	Design Error Diagnosis Based on Verification Techniques.	Asian Test Symposium	2003	DBLP DOI BibTeX RDF
10	Harald Ganzinger, Thomas Hillenbrand, Uwe Waldmann	Superposition Modulo a Shostak Theory.	CADE	2003	DBLP DOI BibTeX RDF
10	Hans Kleine Büning, Xishun Zhao	Read-Once Unit Resolution.	SAT	2003	DBLP DOI BibTeX RDF
10	Sven Baumer, Rainer Schuler	Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs.	SAT	2003	DBLP DOI BibTeX RDF
10	John V. Franco, Michal Kouril, John S. Schlipf, Jeffrey Ward, Sean A. Weaver, Michael R. Dransfield, W. Mark Vanfleet	SBSAT: a State-Based, BDD-Based Satisfiability Solver.	SAT	2003	DBLP DOI BibTeX RDF
10	Ashish Sabharwal, Paul Beame, Henry A. Kautz	Using Problem Structure for Efficient Clause Learning.	SAT	2003	DBLP DOI BibTeX RDF
10	Fahiem Bacchus, Jonathan Winter	Effective Preprocessing with Hyper-Resolution and Equality Reduction.	SAT	2003	DBLP DOI BibTeX RDF
10	Youichi Hanatani, Takashi Horiyama, Kazuo Iwama	Density Condensation of Boolean Formulas.	SAT	2003	DBLP DOI BibTeX RDF
10	Aarti Gupta, Malay K. Ganai, Zijiang Yang 0006, Pranav Ashar	Iterative Abstraction using SAT-based BMC with Proof Analysis.	ICCAD	2003	DBLP DOI BibTeX RDF
10	Miroslav N. Velev	Automatic Abstraction of Equations in a Logic of Equality.	TABLEAUX	2003	DBLP DOI BibTeX RDF
10	Minqiang Li, Li Zhi	Learning DNF Concepts by Constrained Clustering of Positive Instances.	IAT	2003	DBLP DOI BibTeX RDF
10	Simon de Givry, Javier Larrosa, Pedro Meseguer, Thomas Schiex	Solving Max-SAT as Weighted CSP.	CP	2003	DBLP DOI BibTeX RDF
10	David G. Mitchell	Resolution and Constraint Satisfaction.	CP	2003	DBLP DOI BibTeX RDF
10	Jae-Seok Yang, Jeong-Yeol Kim, Joon-Ho Choi, Moon-Hyun Yoo, Jeong-Taek Kong	Elimination of false aggressors using the functional relationship for full-chip crosstalk analysis.	ISQED	2003	DBLP DOI BibTeX RDF
10	Albert Atserias, Víctor Dalmau	A Combinatorial Characterization of Resolution Width.	CCC	2003	DBLP DOI BibTeX RDF
10	Robert F. Damiano, James H. Kukula	Checking satisfiability of a conjunction of BDDs.	DAC	2003	DBLP DOI BibTeX RDF	satisfiability, BDD
10	Eli Ben-Sasson	Hard examples for the bounded depth Frege proof system.	Comput. Complex.	2002	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000). 03F20
10	Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi	Homogenization and the polynomial calculus.	Comput. Complex.	2002	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000). 68Q17
10	Uwe Schöning	A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart.	Algorithmica	2002	DBLP DOI BibTeX RDF	NP-completeness, Satisfiability problem
10	Kenneth L. McMillan	Applying SAT Methods in Unbounded Symbolic Model Checking.	CAV	2002	DBLP DOI BibTeX RDF
10	Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios G. Lalas	The Probabilistic Analysis of a Greedy Satisfiability Algorithm.	ESA	2002	DBLP DOI BibTeX RDF
10	Syed Sibte Raza Abidi, Kok Meng Hoe	Symbolic Exposition of Medical Data-Sets: A Data Mining Workbench to Inductively Derive Data-Defining Symbolic Rules.	CBMS	2002	DBLP DOI BibTeX RDF
10	Stephan Schulz 0001, Geoff Sutcliffe	System Description: GrAnDe 1.0.	CADE	2002	DBLP DOI BibTeX RDF
10	Matthias Krause 0001	On the Computational Power of Boolean Decision Lists.	STACS	2002	DBLP DOI BibTeX RDF	Boolean Complexity Theory, Lower Bounds, Learnability
10	Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah	Improving the Efficiency of Circuit-to-BDD Conversion by Gate and Input Ordering.	ICCD	2002	DBLP DOI BibTeX RDF
10	Lintao Zhang, Sharad Malik	Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation.	CP	2002	DBLP DOI BibTeX RDF
10	Eli Ben-Sasson	Size space tradeoffs for resolution.	STOC	2002	DBLP DOI BibTeX RDF
10	Eldar Fischer, Eric Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, Alex Samorodnitsky	Monotonicity testing over general poset domains.	STOC	2002	DBLP DOI BibTeX RDF	algorithms, property testing, monotone functions
10	Thomas Eiter, Georg Gottlob, Kazuhisa Makino	New results on monotone dualization and generating hypergraph transversals.	STOC	2002	DBLP DOI BibTeX RDF	combinatorial enumeration, hypergraph acyclicity, limited nondeterminism, output-polynomial algorithms, transversal computation, treewidth, dualization
10	Eli Ben-Sasson	Hard examples for bounded depth frege.	STOC	2002	DBLP DOI BibTeX RDF
10	Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban	Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution.	ICALP	2001	DBLP DOI BibTeX RDF
10	Syed Sibte Raza Abidi, Kok Meng Hoe, Alwyn Goh	Analyzing Data Clusters: A Rough Sets Approach to Extract Cluster-Defining Symbolic Rules.	IDA	2001	DBLP DOI BibTeX RDF
10	Beitao Li, Edward Y. Chang, Chung-Sheng Li	Learning Image Query Concepts via Intelligent Sampling.	ICME	2001	DBLP DOI BibTeX RDF
10	Neeraj Mittal, Vijay K. Garg	On Detecting Global Predicates in Distributed Computations.	ICDCS	2001	DBLP DOI BibTeX RDF
10	Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes	Capturing Structure with Satisfiability.	CP	2001	DBLP DOI BibTeX RDF
10	Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy	A sharp threshold in proof complexity.	STOC	2001	DBLP DOI BibTeX RDF
10	Jens Claußen, Alfons Kemper, Guido Moerkotte, Klaus Peithner, Michael Steinbrunn	Optimization and Evaluation of Disjunctive Queries.	IEEE Trans. Knowl. Data Eng.	2000	DBLP DOI BibTeX RDF	disjunctive queries, query evaluation plans, expensive query predicates, bypass processing, query processing, Query optimization
10	James J. Lu, Neil V. Murray, Erik Rosenthal	Annotated Hyperresolution for Non-horn Regular Multiple-Valued Logics.	ISMIS	2000	DBLP DOI BibTeX RDF
10	Steven Gordon, Jonathan Billington	Analysing the WAP Class 2 Wireless Transaction Protocol Using Coloured Petri Nets.	ICATPN	2000	DBLP DOI BibTeX RDF
10	Reinhard Pichler	Negation Elimination from Simple Equational Formulae.	ICALP	2000	DBLP DOI BibTeX RDF
10	Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning	Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search.	ICALP	2000	DBLP DOI BibTeX RDF
10	Josh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi	Homogenization and the Polynominal Calculus.	ICALP	2000	DBLP DOI BibTeX RDF
10	Erik Winfree, Tony Eng, Grzegorz Rozenberg	String Tile Models for DNA Computing by Self-Assembly.	DNA Computing	2000	DBLP DOI BibTeX RDF
10	Edgar Altamirano, Gonzalo Escalada-Imaz	Finding Tractable Formulas in NNF.	Computational Logic	2000	DBLP DOI BibTeX RDF
10	Marianne Brown, Geoff Sutcliffe	System Description: PTTP+GLiDes: Semantically Guided PTTP.	CADE	2000	DBLP DOI BibTeX RDF
10	Renato Bruni, Antonio Sassano	Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances.	CP	2000	DBLP DOI BibTeX RDF
10	João Marques-Silva 0001	Algebraic Simplification Techniques for Propositional Satisfiability.	CP	2000	DBLP DOI BibTeX RDF
10	Christer Berg, Staffan Ulfberg	Symmetric Approximation Arguments for Monotone Lower Bounds Without Sunflowers.	Comput. Complex.	1999	DBLP DOI BibTeX RDF	lower bounds, Circuit complexity, monotone circuits
10	Nikhil Bansal 0001, Venkatesh Raman 0001	Upper Bounds for MaxSat: Further Improved.	ISAAC	1999	DBLP DOI BibTeX RDF
10	Takashi Horiyama, Toshihide Ibaraki	Ordered Binary Decision Diagrams as Knowledge-Bases.	ISAAC	1999	DBLP DOI BibTeX RDF
10	Uwe Schöning	A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems.	FOCS	1999	DBLP DOI BibTeX RDF	satisfiability, constraint satisfaction problem, local-search algorithm, k-SAT
10	Maria Luisa Bonet, Nicola Galesi	A Study of Proof Search Algorithms for Resolution and Polynomial Calculus.	FOCS	1999	DBLP DOI BibTeX RDF
10	Georg Gottlob, Francesco Scarcello, Martha Sideri	Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning.	LPNMR	1999	DBLP DOI BibTeX RDF	Complexity, Logic Programming, Constraint Satisfaction, Nonmonotonic Reasoning, Fixed-parameter Tractability, Stable Models, Prime Implicants, Circumscription
10	Reinhard Pichler	Solving Equational Problems Efficiently.	CADE	1999	DBLP DOI BibTeX RDF
10	Clemens Lautemann, Bernhard Weinzinger	MonadicNLIN and Quantifier-Free Reductions.	CSL	1999	DBLP DOI BibTeX RDF
10	Enrico Giunchiglia, Fausto Giunchiglia, Armando Tacchella	The SAT-Based Approach for Classical Modal Logics.	AI*IA	1999	DBLP DOI BibTeX RDF
10	Anna Gál, Shai Halevi, Richard J. Lipton, Erez Petrank	Computing from Partial Solutions.	CCC	1999	DBLP DOI BibTeX RDF	Robust proofs, erasure correction, erasure-resilient reductions, fault tolerant computations, NP-Hardness
10	Russell Impagliazzo, Ramamohan Paturi	Complexity of k-SAT.	CCC	1999	DBLP DOI BibTeX RDF	NP-completeness, Satisfiability, Reductions, Complexity Theory
10	Pavel Pudlák	Satisfiability - Algorithms and Logic.	MFCS	1998	DBLP DOI BibTeX RDF
10	Evgueni N. Smirnov, Peter J. Braspenning	Version Space Retraction with Instance-Based Boundary Sets.	AIMSA	1998	DBLP DOI BibTeX RDF
10	Wilsin Gosti, Alberto L. Sangiovanni-Vincentelli, Tiziano Villa, Alexander Saldanha	An Exact Input Encoding Algorithm for BDDs Representing FSMs.	Great Lakes Symposium on VLSI	1998	DBLP DOI BibTeX RDF	input encoding, finite state machines, binary decision diagrams, multi-valued decision diagrams
10	Hans Kleine Büning	An Upper Bound for Minimal Resolution Refutations.	CSL	1998	DBLP DOI BibTeX RDF	propositional formulas, length of proofs, minimal unsatisfiability, resolution
10	Reiner Hähnle, Neil V. Murray, Erik Rosenthal	Completeness for Linear Regular Negation Normal Form Inference Systems.	ISMIS	1997	DBLP DOI BibTeX RDF	tableau method, non-clausal inference, negation normal form, completeness, resolution, Logic for Artificial Intelligence
10	Wim Van Laer, Luc De Raedt, Saso Dzeroski	On Multi-class Problems and Discretization in Inductive Logic Programming.	ISMIS	1997	DBLP DOI BibTeX RDF	Classification, Learning, Knowledge Discovery, Discretization, Inductive Logic Programming
10	Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener	On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs.	MFCS	1997	DBLP DOI BibTeX RDF
10	Sanjeev Khanna, Madhu Sudan 0001, Luca Trevisan	Constraint Satisfaction: The Approximability of Minimization Problems.	CCC	1997	DBLP DOI BibTeX RDF	complete problems, computational classes, computational complexity, Approximation algorithms, combinatorial optimization
10	Peter Heusch	The Complexity of the Falsifiability Problem for Pure Implicational Formulas.	MFCS	1995	DBLP DOI BibTeX RDF	Subject classification algorithms and data structures, logic in computer science
10	John Esch, Robert Levinson	In Implementation Model for Contexts and Negation in Conceptual Graphs.	ICCS	1995	DBLP DOI BibTeX RDF	Contexts, Knowledge Representation, Consistency, Retrieval, Inference, Conceptual Graphs, Negation
10	Thomas R. Hancock, Tao Jiang 0001, Ming Li 0001, John Tromp	Lower Bounds on Learning Decision Lists and Trees (Extended Abstract).	STACS	1995	DBLP DOI BibTeX RDF
10	Bernhard Beckert, Reiner Hähnle	Deduction by Combining Semantic Tableaux and Integer Programming.	CSL	1995	DBLP DOI BibTeX RDF
10	Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth	On Learning Read-k-Satisfy-j DNF.	COLT	1994	DBLP DOI BibTeX RDF
10	Anavai Ramesh, Neil V. Murray	Non-Clausal Deductive Techniques for Computing Prime Implicants and Prime Implicates.	LPAR	1993	DBLP DOI BibTeX RDF
10	Claire Kenyon, Valerie King	On Boolean Decision Trees with Faulty Nodes.	ISTCS	1992	DBLP DOI BibTeX RDF
10	Robert H. Sloan	Corrigendum to Types of Noise in Data for Concept Learning.	COLT	1992	DBLP DOI BibTeX RDF
10	Kanchana Kanchanasut, Peter J. Stuckey	Eliminating Negation from Normal Logic Programs.	ALP	1990	DBLP DOI BibTeX RDF
10	Ewald Speckenmeyer	Is Average Superlinear Speedup Possible?	CSL	1988	DBLP DOI BibTeX RDF
10	Oded Goldreich 0001, Silvio Micali, Avi Wigderson	How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design.	CRYPTO	1986	DBLP DOI BibTeX RDF