On the public citation graph

The MathSAT 3 System

0 signed · 70 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/11513988_34openalex-snapshot
Efficient Satisfiability Modulo Theories via Delayed Theory Combination
inferredcites →https://doi.org/10.1007/11527695_2openalex-snapshot
A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints
inferredcites →https://doi.org/10.1007/3-540-45470-5_22openalex-snapshot
Integrating Boolean and Mathematical Solving: Foundations, Basic Algorithms, and Requirements
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/978-3-540-24605-3_37openalex-snapshot
An Extensible SAT-solver
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_14openalex-snapshot
DPLL(T): Fast Decision Procedures
inferredcites →https://doi.org/10.1007/978-3-540-31980-1_21openalex-snapshot
An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic
inferredcites →https://doi.org/10.1007/978-3-540-39813-4_5openalex-snapshot
Congruence Closure with Integer Offsets
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_34openalex-snapshot
Theorem Proving Using Lazy Proof Explication
inferredcites →https://doi.org/10.1007/s101070050058openalex-snapshot
Negative-cycle detection algorithms
inferredcites →https://doi.org/10.1007/s10817-005-9004-zopenalex-snapshot
MathSAT: Tight Integration of SAT and Mathematical Decision Procedures
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7070-3openalex-snapshot
Solvable Cases of the Decision Problem
inferredcites →https://doi.org/10.1109/12.769433openalex-snapshot
GRASP: a search algorithm for propositional satisfiability
inferredcites →https://doi.org/10.1145/129393.129398openalex-snapshot
The CLP( ℛ ) language and system
inferredcites →https://doi.org/10.1145/378239.379017openalex-snapshot
Chaff
inferredcites →https://doi.org/10.1145/504704.504705openalex-snapshot
The Cassowary linear arithmetic constraint solving algorithm
inferredcites →https://doi.org/10.2307/2964059openalex-snapshot
W. Ackermann. Solvable cases of the decision problem. Studies in logic and the foundations of mathematics. North-Holland Publishing Company, Amsterdam1954, VIII + 114 pp.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11691372_11openalex-snapshot
Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants
inferred← citeshttps://doi.org/10.1007/11817963_11openalex-snapshot
A Fast Linear-Arithmetic Solver for DPLL(T)
inferred← citeshttps://doi.org/10.1007/11817963_42openalex-snapshot
The Heuristic Theorem Prover: Yet Another SMT Modulo Theorem Prover
inferred← citeshttps://doi.org/10.1007/978-1-4419-9359-5_6openalex-snapshot
Bounded Model Checking for Concurrent Systems: Synchronous Vs. Asynchronous
inferred← citeshttps://doi.org/10.1007/978-3-031-36751-9_3openalex-snapshot
Entwurfsautomatisierungsmethoden für konventionelle Systeme
inferred← citeshttps://doi.org/10.1007/978-3-319-31937-7_2openalex-snapshot
Background
inferred← citeshttps://doi.org/10.1007/978-3-319-31937-7_3openalex-snapshot
Optimizations and Complexity Analysis on the Reversible Level
inferred← citeshttps://doi.org/10.1007/978-3-319-31937-7_4openalex-snapshot
Optimization and Complexity Analysis on the Mapping Level
inferred← citeshttps://doi.org/10.1007/978-3-319-31937-7_5openalex-snapshot
Optimizations and Complexity Analysis on the Quantum Level
inferred← citeshttps://doi.org/10.1007/978-3-540-69848-7_79openalex-snapshot
Parallel Actions and Generalized Multivalued Constraints in Multivalued Planning
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_27openalex-snapshot
The Barcelogic SMT Solver
inferred← citeshttps://doi.org/10.1007/978-3-540-72200-7_31openalex-snapshot
Enhancing ASP Systems for Planning with Temporal Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_36openalex-snapshot
LIRA: Handling Constraints of Linear Arithmetics over the Integers and the Reals
inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_2openalex-snapshot
Challenges in Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-75596-8_18openalex-snapshot
Verifying Heap-Manipulating Programs in an SMT Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-79719-7_8openalex-snapshot
SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers
inferred← citeshttps://doi.org/10.1007/978-90-481-9304-2_14openalex-snapshot
SMT-based Stimuli Generation in the SystemC Verification Library
inferred← citeshttps://doi.org/10.1007/978-90-481-9579-4_4openalex-snapshot
Exact Synthesis of Reversible Logic
inferred← citeshttps://doi.org/10.1007/s10009-009-0105-6openalex-snapshot
Satisfiability solving for software verification
inferred← citeshttps://doi.org/10.1007/s10462-018-9628-0openalex-snapshot
A comprehensive study and analysis on SAT-solvers: advances, usages and achievements
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.artint.2012.08.001openalex-snapshot
Planning as satisfiability: Heuristics
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.079openalex-snapshot
Model-based Theory Combination
inferred← citeshttps://doi.org/10.1016/j.ic.2006.08.009openalex-snapshot
Fast congruence closure and extensions
inferred← citeshttps://doi.org/10.1016/j.jlap.2010.07.003openalex-snapshot
Engineering constraint solvers for automatic analysis of probabilistic hybrid automata
inferred← citeshttps://doi.org/10.1016/j.nahs.2010.04.009openalex-snapshot
Constraint-based analysis of concurrent probabilistic hybrid systems: An application to networked automation systems
inferred← citeshttps://doi.org/10.1016/j.scico.2007.08.001openalex-snapshot
The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems
inferred← citeshttps://doi.org/10.1109/fmcad.2009.5351140openalex-snapshot
Efficient decision procedure for non-linear arithmetic constraints using CORDIC
inferred← citeshttps://doi.org/10.1109/iccad.2007.4397244openalex-snapshot
Fast exact toffoli network synthesis of reversible logic
inferred← citeshttps://doi.org/10.1109/icps51978.2022.9816888openalex-snapshot
Symbolic Encoding of Reliability for the Design of Redundant Architectures
inferred← citeshttps://doi.org/10.1109/ised.2017.8303924openalex-snapshot
Towards lightweight satisfiability solvers for self-verification
inferred← citeshttps://doi.org/10.1109/ismvl.2009.28openalex-snapshot
Evaluation of Cardinality Constraints on SMT-Based Debugging
inferred← citeshttps://doi.org/10.1109/isvlsi.2008.82openalex-snapshot
Using Higher Levels of Abstraction for Solving Optimization Problems by Boolean Satisfiability
inferred← citeshttps://doi.org/10.1109/recosoc.2015.7238101openalex-snapshot
Envisioning self-verification of electronic systems
inferred← citeshttps://doi.org/10.1109/sies.2015.7185054openalex-snapshot
Optimal SAT-based scheduler for time-triggered networks-on-a-chip
inferred← citeshttps://doi.org/10.1109/tcad.2009.2017215openalex-snapshot
Exact Multiple-Control Toffoli Network Synthesis With SAT Techniques
inferred← citeshttps://doi.org/10.1145/1233501.1233664openalex-snapshot
Accelerating high-level bounded model checking
inferred← citeshttps://doi.org/10.1145/1391469.1391507openalex-snapshot
Tunneling and slicing
inferred← citeshttps://doi.org/10.1145/1403375.1403578openalex-snapshot
Completeness in SMT-based BMC for software programs
inferred← citeshttps://doi.org/10.1145/3238147.3238218openalex-snapshot
Control flow-guided SMT solving for program verification
inferred← citeshttps://doi.org/10.1145/3446211openalex-snapshot
Leveraging Control Flow Knowledge in SMT Solving of Program Verification
inferred← citeshttps://doi.org/10.1201/9780849380273-15openalex-snapshot
Formal Methods in the Automotive Domain: The Case of TTA
inferred← citeshttps://doi.org/10.1201/9780849380273.ch15openalex-snapshot
Formal Methods in the Automotive Domain
inferred← citeshttps://doi.org/10.1504/ijaisc.2009.027291openalex-snapshot
A multivalued planning model
inferred← citeshttps://doi.org/10.15168/11572_368709openalex-snapshot
Parametric Real-Time System Feasibility Analysis Using Parametric Timed Automata
inferred← citeshttps://doi.org/10.1631/jzus.a0820812openalex-snapshot
Equality detection for linear arithmetic constraints
inferred← citeshttps://doi.org/10.23919/date.2019.8714967openalex-snapshot
Better Late Than Never : Verification of Embedded Systems After Deployment
inferred← citeshttps://doi.org/10.2514/6.2012-1294460openalex-snapshot
Innovative Rover Operations Concepts - Autonomous Planner (IRONCAP) - Supporting Rover Operations Planning on Ground
inferred← citeshttps://doi.org/10.2514/6.2014-1838openalex-snapshot
Innovative Rover Operations Concepts - Autonomous Planner (IRONCAP) - Concluding the adventure
inferred← citeshttps://doi.org/10.3233/sat190014openalex-snapshot
Translating Pseudo-Boolean Constraints into SAT
inferred← citeshttps://doi.org/10.3233/sat190031openalex-snapshot
SDSAT: Tight Integration of Small Domain Encoding and Lazy Approaches in Solving Difference Logic
inferred← citeshttps://doi.org/10.5555/1326073.1326087openalex-snapshot
Fast exact Toffoli network synthesis of reversible logic
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95294openalex-snapshot
Bounded model checking for asynchronous concurrent systems
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.