On the public citation graph

A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems

https://doi.org/10.1007/11493853_24
0 signed · 38 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.1007/3-540-45620-1openalex-snapshot
Automated Deduction—CADE-18
inferredcites →https://doi.org/10.1007/3-540-45620-1_17openalex-snapshot
A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions
inferredcites →https://doi.org/10.1007/3-540-58601-6_92openalex-snapshot
Beyond finite domains
inferredcites →https://doi.org/10.1007/978-1-4612-1960-6_5openalex-snapshot
Mixed-Integer Nonlinear Programming: A Survey of Algorithms and Applications
inferredcites →https://doi.org/10.1007/978-1-4612-4210-9openalex-snapshot
Asynchronous Circuits
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_37openalex-snapshot
An Extensible SAT-solver
inferredcites →https://doi.org/10.1007/978-3-540-24664-0_7openalex-snapshot
SAT-Based Branch & Bound and Optimal Control of Hybrid Dynamical Systems
inferredcites →https://doi.org/10.1007/978-3-540-40903-8_17openalex-snapshot
On Timing Analysis of Combinational Circuits
inferredcites →https://doi.org/10.1007/bf02023076openalex-snapshot
Applying tabu search to the job-shop scheduling problem
inferredcites →https://doi.org/10.1007/bfb0031808openalex-snapshot
Validity checking for combinations of theories with equality
inferredcites →https://doi.org/10.1016/0098-1354(93)e0010-7openalex-snapshot
Modelling and computational techniques for logic based integer programming
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/12.769433openalex-snapshot
GRASP: a search algorithm for propositional satisfiability
inferredcites →https://doi.org/10.1109/lics.2004.1319604openalex-snapshot
Deciding quantifier-free Presburger formulas using parameterized solution bounds
inferredcites →https://doi.org/10.1145/321021.321023openalex-snapshot
A Mechanical Proof Procedure and its Realization in an Electronic Computer
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/322276.322288openalex-snapshot
Deciding Linear Inequalities by Computing Loop Residues
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/378239.379017openalex-snapshot
Chaff
inferredcites →https://doi.org/10.1145/774572.774638openalex-snapshot
Generic ILP versus specialized 0-1 ILP
inferredcites →https://doi.org/10.1184/r1/6707129openalex-snapshot
On Integrating Constraint Propagation and Linear Programming for Combinatorial Optimization
inferredcites →https://doi.org/10.1287/ijoc.3.2.149openalex-snapshot
A Computational Study of the Job-Shop Scheduling Problem
inferredcites →https://doi.org/10.5860/choice.38-3939openalex-snapshot
Logic-based methods for optimization: combining optimization and constraint satisfaction

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11564751_45openalex-snapshot
On Solving Soft Temporal Constraints Using SAT Techniques
inferred← citeshttps://doi.org/10.1007/11814948_1openalex-snapshot
From Propositional Satisfiability to Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/11814948_20openalex-snapshot
A Progressive Simplifier for Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/s10817-006-9026-1openalex-snapshot
Design and Results of the First Satisfiability Modulo Theories Competition (SMT-COMP 2005)
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.07.017openalex-snapshot
Using Satisfiability Modulo Theories for Inductive Verification of Lustre Programs
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80019-2openalex-snapshot
Operations Research Methods in Constraint Programming
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1109/date.2007.364411openalex-snapshot
Tool-support for the analysis of hybrid systems and models
inferred← citeshttps://doi.org/10.1109/iccad.2006.320088openalex-snapshot
SMT(CLU): A Step toward Scalability in System Verification
inferred← citeshttps://doi.org/10.1145/1177352.1177354openalex-snapshot
Propositional Satisfiability and Constraint Programming
inferred← citeshttps://doi.org/10.1145/1233501.1233680openalex-snapshot
SMT(CLU)
inferred← citeshttps://doi.org/10.1145/1273463.1273473openalex-snapshot
Automating component-based system assembly
inferred← citeshttps://doi.org/10.1145/3770855.3817669openalex-snapshot
SAT Solver Selection: Move Beyond Handcrafted Features
inferred← citeshttps://doi.org/10.3233/sat190014openalex-snapshot
Translating Pseudo-Boolean Constraints into SAT
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.