On the public citation graph

The Good Old Davis-Putnam Procedure Helps Counting Models

0 signed · 111 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/int.4550040402openalex-snapshot
Answering atomic queries in indefinite deductive databases
inferredcites →https://doi.org/10.1016/0004-3702(94)00092-1openalex-snapshot
On the hardness of approximate reasoning
inferredcites →https://doi.org/10.1016/0020-0190(82)90110-7openalex-snapshot
Average time analysis of simplified Davis-Putnam procedures
inferredcites →https://doi.org/10.1016/0020-0190(92)90160-wopenalex-snapshot
Counting propositional models
inferredcites →https://doi.org/10.1016/0166-218x(83)90017-3openalex-snapshot
Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/0304-3975(91)90315-sopenalex-snapshot
Counting the number of solutions for instances of satisfiability
inferredcites →https://doi.org/10.1016/0304-3975(95)00144-1openalex-snapshot
Number of models and satisfiability of sets of clauses
inferredcites →https://doi.org/10.1080/09528139508953817openalex-snapshot
Is there an alternative to parsimonious semantics?
inferredcites →https://doi.org/10.1137/0218026openalex-snapshot
CNF-Satisfiability Test by Counting and Polynomial Average Time
inferredcites →https://doi.org/10.1145/100216.100250openalex-snapshot
Approximate inclusion-exclusion
inferredcites →https://doi.org/10.1145/103418.103464openalex-snapshot
On deterministic approximation of DNF
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1613/jair.61openalex-snapshot
Random Worlds and Maximum Entropy

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/aaai.12169openalex-snapshot
The 2023 International Planning Competition
inferred← citeshttps://doi.org/10.1007/11499107_24openalex-snapshot
A New Approach to Model Counting
inferred← citeshttps://doi.org/10.1007/11527695_13openalex-snapshot
Using DPLL for Efficient OBDD Construction
inferred← citeshttps://doi.org/10.1007/11579427_14openalex-snapshot
Geometric Aspects Related to Solutions of #kSAT
inferred← citeshttps://doi.org/10.1007/11814948_38openalex-snapshot
sharpSAT – Counting Models with Advanced Component Caching and Implicit BCP
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_57openalex-snapshot
Counting Satisfying Assignments in 2-SAT and 3-SAT
inferred← citeshttps://doi.org/10.1007/978-1-4020-2653-9openalex-snapshot
Automated Model Building
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_21openalex-snapshot
Phase Transition Behavior in Knowledge Compilation
inferred← citeshttps://doi.org/10.1007/978-3-030-63618-0_8openalex-snapshot
MCBAT: Model Counting for Constraints over Bounded Integer Arrays
inferred← citeshttps://doi.org/10.1007/978-3-031-13185-1_18openalex-snapshot
A Scalable Shannon Entropy Estimator
inferred← citeshttps://doi.org/10.1007/978-3-031-16681-5_19openalex-snapshot
OuterCount: A First-Level Solution-Counter for Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1007/978-3-031-33271-5_26openalex-snapshot
Generating Random Instances of Weighted Model Counting
inferred← citeshttps://doi.org/10.1007/978-3-031-98682-6_5openalex-snapshot
Engineering an Efficient Probabilistic Exact Model Counter
inferred← citeshttps://doi.org/10.1007/978-3-319-19647-3_22openalex-snapshot
Approximate Model Counting via Extension Rule
inferred← citeshttps://doi.org/10.1007/978-3-319-23404-5_15openalex-snapshot
Model Counting for Complex Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-27926-8_23openalex-snapshot
Characterization of the $$\#k$$ # k –SAT Problem in Terms of Connected Components
inferred← citeshttps://doi.org/10.1007/978-3-319-66263-3_6openalex-snapshot
Symmetric Explanation Learning: Effective Dynamic Symmetry Handling for SAT
inferred← citeshttps://doi.org/10.1007/978-3-319-89960-2_8openalex-snapshot
Bit-Vector Model Counting Using Statistical Estimation
inferred← citeshttps://doi.org/10.1007/978-3-540-30494-4_20openalex-snapshot
Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-13520-0_24openalex-snapshot
Upper Bounds on the Number of Solutions of Binary Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-17511-4_19openalex-snapshot
Semiring-Induced Propositional Logic: Definition and Basic Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_31openalex-snapshot
Phase Transitions in Knowledge Compilation: An Experimental Study
inferred← citeshttps://doi.org/10.1007/978-3-642-37401-2openalex-snapshot
Web Technologies and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_18openalex-snapshot
A Scalable Approximate Model Counter
inferred← citeshttps://doi.org/10.1007/s00778-012-0268-8openalex-snapshot
Mining frequent subgraphs over uncertain graph databases under probabilistic semantics
inferred← citeshttps://doi.org/10.1007/s00778-013-0310-5openalex-snapshot
Anytime approximation in probabilistic databases
inferred← citeshttps://doi.org/10.1007/s10462-004-4329-2openalex-snapshot
Counting for Satisfiability by Inverting Resolution
inferred← citeshttps://doi.org/10.1007/s10601-024-09369-4openalex-snapshot
Counting QBF solutions at level two
inferred← citeshttps://doi.org/10.1007/s10703-011-0121-5openalex-snapshot
Feasibility analysis for robustness quantification by symbolic model checking
inferred← citeshttps://doi.org/10.1007/s11432-014-5154-0openalex-snapshot
Experimental analyses on phase transitions in compiling satisfiability problems
inferred← citeshttps://doi.org/10.1016/b978-155860872-6/50030-5openalex-snapshot
BIBLIOGRAPHY
inferred← citeshttps://doi.org/10.1016/j.dam.2006.09.014openalex-snapshot
Phase transitions of PP-complete satisfiability problems
inferred← citeshttps://doi.org/10.1016/j.dam.2024.10.021openalex-snapshot
On enumerating short projected models
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.11.039openalex-snapshot
Bose–Einstein condensation in satisfiability problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.02.035openalex-snapshot
Algorithms for four variants of the exact satisfiability problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.04.047openalex-snapshot
Two approximate algorithms for model counting
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00332-4openalex-snapshot
Learning to Select Branching Rules in the DPLL Procedure for Satisfiability
inferred← citeshttps://doi.org/10.1023/a:1017584715408openalex-snapshot
Stochastic Boolean Satisfiability
inferred← citeshttps://doi.org/10.1080/09528130500128235openalex-snapshot
Another look at the phenomenon of phase transition
inferred← citeshttps://doi.org/10.1080/09528131003712988openalex-snapshot
Typical models: minimising false beliefs
inferred← citeshttps://doi.org/10.1088/1367-2630/18/7/073003openalex-snapshot
Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems
inferred← citeshttps://doi.org/10.1093/logcom/exm051openalex-snapshot
Combining Syntax and Semantics through Prime Form Representation
inferred← citeshttps://doi.org/10.1103/physreve.109.055301openalex-snapshot
Ising model partition-function computation as a weighted counting problem
inferred← citeshttps://doi.org/10.1103/physreve.110.034126openalex-snapshot
Counting the number of solutions in satisfiability problems with tensor-network message passing
inferred← citeshttps://doi.org/10.1109/access.2018.2855739openalex-snapshot
A Parallel Extension Rule-Based Algorithm for #SAT Problem Using Model-Counting Tree
inferred← citeshttps://doi.org/10.1109/fiot.2018.8325589openalex-snapshot
SAT solving by CSFLOC, the next generation of full-length clause counting algorithms
inferred← citeshttps://doi.org/10.1109/icde.2010.5447826openalex-snapshot
Approximate confidence computation in probabilistic databases
inferred← citeshttps://doi.org/10.1109/ictai.2005.69openalex-snapshot
Good learning and implicit model enumeration
inferred← citeshttps://doi.org/10.1109/ictai.2018.00111openalex-snapshot
Dualizing Projected Model Counting
inferred← citeshttps://doi.org/10.1109/ictai.2019.00017openalex-snapshot
Centrality Heuristics for Exact Model Counting
inferred← citeshttps://doi.org/10.1109/rttas.2004.1317295openalex-snapshot
Incremental satisfiability counting for real-time systems
inferred← citeshttps://doi.org/10.1109/synasc.2007.16openalex-snapshot
Approximate Satisfiability Counting
inferred← citeshttps://doi.org/10.1109/synasc.2009.12openalex-snapshot
A Hierarchy of Tractable Subclasses for SAT and Counting SAT Problems
inferred← citeshttps://doi.org/10.1109/synasc.2015.38openalex-snapshot
Solving SAT by an Iterative Version of the Inclusion-Exclusion Principle
inferred← citeshttps://doi.org/10.1109/tcad.2017.2652220openalex-snapshot
Incremental SAT-Based Reverse Engineering of Camouflaged Logic Circuits
inferred← citeshttps://doi.org/10.1109/tse.2026.3696093openalex-snapshot
Tackling Expressive Feature-Modeling Constructs With Pseudo-Boolean d-DNNF Compilation
inferred← citeshttps://doi.org/10.1145/1835804.1835885openalex-snapshot
Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics
inferred← citeshttps://doi.org/10.1145/2590296.2590328openalex-snapshot
Abstract model counting
inferred← citeshttps://doi.org/10.1145/2594291.2594331openalex-snapshot
A model counter for constraints over unbounded strings
inferred← citeshttps://doi.org/10.1145/3368089.3417937openalex-snapshot
MCBAT: a practical tool for model counting constraints on bounded integer arrays
inferred← citeshttps://doi.org/10.1145/3744915.3748473openalex-snapshot
Exploring the Computational Complexity of Uniform Random Sampling and SAT Counting with Phase Transitions
inferred← citeshttps://doi.org/10.14288/1.0051829openalex-snapshot
Aggregation and constraint processing in lifted probabilistic inference
inferred← citeshttps://doi.org/10.14778/1453856.1453894openalex-snapshot
Conditioning probabilistic databases
inferred← citeshttps://doi.org/10.14778/2350229.2350236openalex-snapshot
Probabilistic databases with MarkoViews
inferred← citeshttps://doi.org/10.15476/elte.2019.163openalex-snapshot
Formal Methods for Modelling Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1609/aaai.v34i02.5524openalex-snapshot
Estimating the Density of States of Boolean Satisfiability Problems on Classical and Quantum Computing Platforms
inferred← citeshttps://doi.org/10.1609/aaai.v35i14.17474openalex-snapshot
Learning Branching Heuristics for Propositional Model Counting
inferred← citeshttps://doi.org/10.1609/aaai.v35i5.16481openalex-snapshot
Counting Maximal Satisfiable Subsets
inferred← citeshttps://doi.org/10.1609/aaai.v35i5.16503openalex-snapshot
The Power of Literal Equivalence in Model Counting
inferred← citeshttps://doi.org/10.1609/aaai.v35i5.16511openalex-snapshot
Symmetric Component Caching for Model Counting on Combinatorial Instances
inferred← citeshttps://doi.org/10.1609/aaai.v35i7.16776openalex-snapshot
Certifying Top-Down Decision-DNNF Compilers
inferred← citeshttps://doi.org/10.1613/jair.1.11201openalex-snapshot
An Exhaustive DPLL Algorithm for Model Counting
inferred← citeshttps://doi.org/10.1613/jair.2097openalex-snapshot
The Language of Search
inferred← citeshttps://doi.org/10.1613/jair.2648openalex-snapshot
Solving #SAT and Bayesian Inference with Backtracking Search
inferred← citeshttps://doi.org/10.21275/sr24315003002openalex-snapshot
The Impact of Artificial Intelligence on Medicinal Applications
inferred← citeshttps://doi.org/10.2200/s00692ed1v01y201601aim032openalex-snapshot
Statistical Relational Artificial Intelligence: Logic, Probability, and Computation
inferred← citeshttps://doi.org/10.24963/ijcai.2019/163openalex-snapshot
GANAK: A Scalable Probabilistic Exact Model Counter
inferred← citeshttps://doi.org/10.24963/ijcai.2021/617openalex-snapshot
Hybrid Probabilistic Inference with Logical and Algebraic Constraints: a Survey
inferred← citeshttps://doi.org/10.25911/5d7a2d4eb5685openalex-snapshot
Reasoning with Inconsistent Information
inferred← citeshttps://doi.org/10.3233/978-1-60750-606-5-9openalex-snapshot
On Decomposability and Interaction Functions
inferred← citeshttps://doi.org/10.3233/faia230707openalex-snapshot
On the Density of States of Boolean Formulas1
inferred← citeshttps://doi.org/10.4156/jcit.vol5.issue7.7openalex-snapshot
Model Counting with Boolean Algebra and Extension Rule
inferred← citeshttps://doi.org/10.4197/eng.26-1.2openalex-snapshot
Incremental Version of the Modern Syllogistic Method
inferred← citeshttps://doi.org/10.4204/eptcs.29.5openalex-snapshot
Model Counting in Product Configuration
inferred← citeshttps://doi.org/10.4204/eptcs.406.7openalex-snapshot
A Graphical #SAT Algorithm for Formulae with Small Clause Density
inferred← citeshttps://doi.org/10.48550/arxiv.1102.4922openalex-snapshot
Counting Solutions of Constraint Satisfiability Problems:Exact Phase Transitions and Approximate Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1104.0843openalex-snapshot
Phase Transitions in Knowledge Compilation: an Experimental Study
inferred← citeshttps://doi.org/10.48550/arxiv.1105.3833openalex-snapshot
Typical models: minimizing false beliefs
inferred← citeshttps://doi.org/10.48550/arxiv.1306.5726openalex-snapshot
A Scalable Approximate Model Counter
inferred← citeshttps://doi.org/10.48550/arxiv.1404.6682openalex-snapshot
Sampling Techniques for Boolean Satisfiability
inferred← citeshttps://doi.org/10.48550/arxiv.1501.01239openalex-snapshot
On the Relationship between Sum-Product Networks and Bayesian Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1504.02796openalex-snapshot
Model Counting Modulo Theories
inferred← citeshttps://doi.org/10.48550/arxiv.1512.06633openalex-snapshot
Constrained Sampling and Counting: Universal Hashing Meets SAT Solving
inferred← citeshttps://doi.org/10.48550/arxiv.1806.02239openalex-snapshot
Constrained Counting and Sampling: Bridging the Gap between Theory and Practice
inferred← citeshttps://doi.org/10.48550/arxiv.1806.11542openalex-snapshot
High Dimensional Discrete Integration over the Hypergrid
inferred← citeshttps://doi.org/10.5555/545381.545420openalex-snapshot
An algorithm for counting maximum weighted independent sets and its applications
inferred← citeshttps://doi.org/10.5555/777092.777189openalex-snapshot
A compiler for deterministic, decomposable negation normal form
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.