Horn Upper Bounds and Renaming

No abstract is available for this paper.

• Publication year

  2007

• Venue

  Journal on Satisfiability, Boolean Modeling and Computation

• Publication date

  2007-05-28

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.3233/sat190072
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Horn Upper Bounds of Random 3-CNF: A Computational Study

  2006cited by this paper
• First order LUB approximations: characterization and algorithms

  2005cited by this paper
• Pairs of SAT Assignments and Clustering in Random Boolean Formulae

  2005cited by this paper
• Pairs of SAT Assignment in Random Boolean Formulae

  2005cited by this paper
• Hidden Threshold Phenomena for Fixed-Density SAT-formulae

  2003cited by this paper
• A Knowledge Compilation Map

  2002cited by this paper
• Random K-satisfiability problem: from an analytic solution to an efficient algorithm.

  2002cited by this paper
• Random 3-SAT and BDDs: The Plot Thickens Further

  2001cited by this paper
• On counting independent sets in sparse graphs

  1999cited by this paper
• Maximum Renamable Horn sub-CNFs

  1999influential reference
• Effective logic computation

  1998cited by this paper
• Algorithms for Propositional KB Approximation

  1998cited by this paper
• Variable and Term Removal From Boolean Formulae

  1997cited by this paper
• Logic of Computation

  1997cited by this paper
• A survey on knowledge compilation

  1997cited by this paper
• Knowledge compilation and theory approximation

  1996influential reference
• An Empirical Evaluation of Knowledge Compilation by Theory Approximation

  1994influential reference
• On the Hardness of Approximate Reasoning

  1993cited by this paper
• Random Generation of Combinatorial Structures from a Uniform Distribution

  1986cited by this paper
• The evolution of random graphs

  1984cited by this paper
• On the evolution of random graphs

  1984cited by this paper
• Recognizing Disguised NR(1) Instances of the Satisfiability Problem

  1980cited by this paper
• Renaming a Set of Clauses as a Horn Set

  1978cited by this paper
• On sentences which are true of direct unions of algebras

  1951cited by this paper
• The decision problem for some classes of sentences without quantifiers

  1943cited by this paper

• Inbuilt Mechanisms for Managing Weeds in Conservation Agriculture Systems: A Revisit

  2021cites this paper
• Smallholder commercialization and climate change: a simulation game for teff in South Wollo, Ethiopia

  2020cites this paper
• Review of Biomass Resources and Conversion Technologies for Alternative Jet Fuel Production in Hawai’i and Tropical Regions

  2019cites this paper
• Managing Photothermal Environment for Improving Crop Productivity

  2018cites this paper
• Nutrition Potential of Foxtail Millet in Comparison to Other Millets and Major Cereals

  2017cites this paper
• SAT-Based Horn Least Upper Bounds

  2015cites this paper
• Belief revision within fragments of propositional logic

  2012cites this paper
• Boolean Functions

  2011cites this paper
• Horn Belief Contraction: Remainders, Envelopes and Complexity

  2011cites this paper
• On Approximate Horn Formula Minimization

  2010cites this paper
• Combinatorial problems for Horn clauses

  2008cites this paper