On the public citation graph
Controlling a Solver Execution with the runsolver Tool
0 signed · 64 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.3233/sat190018openalex-snapshot
The First Evaluation of Pseudo-Boolean Solvers (PB’05)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-58112-1_26openalex-snapshot
PbO-CCSAT: Boosting Local Search for Satisfiability Using Programming by Optimisation
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_16openalex-snapshot
A Time Leap Challenge for SAT-Solving
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_17openalex-snapshot
Breaking Symmetries with RootClique and LexTopSort
inferred← citeshttps://doi.org/10.1007/978-3-030-80223-3_34openalex-snapshot
Certified DQBF Solving by Definition Extraction
inferred← citeshttps://doi.org/10.1007/978-3-031-04580-6_3openalex-snapshot
Exploiting Similarity in Evolutionary Product Design for Improved Design Space Exploration
inferred← citeshttps://doi.org/10.1007/978-3-031-57259-3openalex-snapshot
Fundamental Approaches to Software Engineering
inferred← citeshttps://doi.org/10.1007/978-3-031-57259-3_11openalex-snapshot
Towards Reliable SQL Synthesis: Fuzzing-Based Evaluation and Disambiguation
inferred← citeshttps://doi.org/10.1007/978-3-319-09584-4_4openalex-snapshot
AClib: A Benchmark Library for Algorithm Configuration
inferred← citeshttps://doi.org/10.1007/978-3-319-19084-6_18openalex-snapshot
Improving the State of the Art in Inexact TSP Solving Using Per-Instance Algorithm Selection
inferred← citeshttps://doi.org/10.1007/978-3-319-23404-5_12openalex-snapshot
Benchmarking and Resource Measurement
inferred← citeshttps://doi.org/10.1007/978-3-319-40970-2_36openalex-snapshot
SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_17openalex-snapshot
BoSy: An Experimentation Framework for Bounded Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-319-66263-3_25openalex-snapshot
SAT-Based Local Improvement for Finding Tree Decompositions of Small Width
inferred← citeshttps://doi.org/10.1007/978-3-319-98334-9_8openalex-snapshot
An SMT Approach to Fractional Hypertree Width
inferred← citeshttps://doi.org/10.1007/978-3-642-40564-8_23openalex-snapshot
VCWC: A Versioning Competition Workflow Compiler
inferred← citeshttps://doi.org/10.1007/s10009-016-0416-3openalex-snapshot
The first reactive synthesis competition (SYNTCOMP 2014)
inferred← citeshttps://doi.org/10.1007/s10009-017-0469-yopenalex-snapshot
Reliable benchmarking: requirements and solutions
inferred← citeshttps://doi.org/10.1007/s10951-020-00666-3openalex-snapshot
Disruptions in timetables: a case study at Universidade de Lisboa
inferred← citeshttps://doi.org/10.1007/s11704-018-7107-zopenalex-snapshot
Empirical investigation of stochastic local search for maximum satisfiability
inferred← citeshttps://doi.org/10.1016/j.artint.2015.01.002openalex-snapshot
Overview and analysis of the SAT Challenge 2012 solver competition
inferred← citeshttps://doi.org/10.1016/j.artint.2016.07.006openalex-snapshot
New local search methods for partial MaxSAT
inferred← citeshttps://doi.org/10.1016/j.artint.2016.11.001openalex-snapshot
CCEHC: An efficient local search algorithm for weighted partial maximum satisfiability
inferred← citeshttps://doi.org/10.1016/j.artint.2019.103229openalex-snapshot
Definability for model counting
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103607openalex-snapshot
Evaluation of argument strength in attack graphs: Foundations and semantics
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104277openalex-snapshot
Athanor: Local search over abstract constraint specifications
inferred← citeshttps://doi.org/10.1016/j.artint.2026.104605openalex-snapshot
The model counting competitions 2021–2023
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105471openalex-snapshot
Exact hypervolume subset selection through incremental computations
inferred← citeshttps://doi.org/10.1016/j.orp.2018.100092openalex-snapshot
Room usage optimization in timetabling: A case study at Universidade de Lisboa
inferred← citeshttps://doi.org/10.1017/s1471068424000036openalex-snapshot
IASCAR: Incremental Answer Set Counting by Anytime Refinement
inferred← citeshttps://doi.org/10.1017/s147106842510029xopenalex-snapshot
Smart Expansion Techniques for ASP-Based Interactive Configuration
inferred← citeshttps://doi.org/10.1017/s1471068426100507openalex-snapshot
ProDebug : An Automated Debugging System for Prolog
inferred← citeshttps://doi.org/10.1039/d4cp01862aopenalex-snapshot
Transfer learning of hyperparameters for fast construction of anisotropic GPR models: design and application to the machine-learned force field FFLUX
inferred← citeshttps://doi.org/10.1109/ase.2015.10openalex-snapshot
Synthesising Interprocedural Bit-Precise Termination Proofs (T)
inferred← citeshttps://doi.org/10.1109/icpics47731.2019.8942577openalex-snapshot
CCEHC-Plus: Reemphasis on Soft Clauses in WPMS Problem based on CCEHC
inferred← citeshttps://doi.org/10.1109/icst62969.2025.10988950openalex-snapshot
Combining Logic and Large Language Models for Assisted Debugging and Repair of ASP Programs
inferred← citeshttps://doi.org/10.1109/ictai.2017.00032openalex-snapshot
Hard Neighboring Variables Based Configuration Checking in Stochastic Local Search for Weighted Partial Maximum Satisfiability
inferred← citeshttps://doi.org/10.1109/tevc.2022.3215013openalex-snapshot
Sparkle: Toward Accessible Meta-Algorithmics for Improving the State of the Art in Solving Challenging Problems
inferred← citeshttps://doi.org/10.1142/s0218213015500050openalex-snapshot
Deterministic Parallel MaxSAT Solving
inferred← citeshttps://doi.org/10.1145/3121136openalex-snapshot
Bit-Precise Procedure-Modular Termination Analysis
inferred← citeshttps://doi.org/10.1145/3338906.3338914openalex-snapshot
Towards more efficient meta-heuristic algorithms for combinatorial test generation
inferred← citeshttps://doi.org/10.1145/3691620.3695358openalex-snapshot
BenchCloud: A Platform for Scalable Performance Benchmarking
inferred← citeshttps://doi.org/10.1145/3768578openalex-snapshot
CUBES: A Parallel Synthesizer for SQL Using Examples
inferred← citeshttps://doi.org/10.1177/30504554241305110openalex-snapshot
The 12th IJCAR Automated Theorem Proving System Competition—CASC-J12
inferred← citeshttps://doi.org/10.1177/30504554261463374openalex-snapshot
The CADE-30 Automated Theorem Proving System Competition—CASC-30
inferred← citeshttps://doi.org/10.1186/s13015-019-0145-8openalex-snapshot
Repairing Boolean logical models from time-series data using Answer Set Programming
inferred← citeshttps://doi.org/10.14288/1.0215912openalex-snapshot
Analysing the empirical time complexity of high-performance algorithms for SAT and TSP
inferred← citeshttps://doi.org/10.1609/aaai.v37i4.25505openalex-snapshot
NuWLS: Improving Local Search for (Weighted) Partial MaxSAT by New Weighting Techniques
inferred← citeshttps://doi.org/10.1609/aaai.v38i8.28638openalex-snapshot
Parallel Empirical Evaluations: Resilience despite Concurrency
inferred← citeshttps://doi.org/10.1613/jair.1.11420openalex-snapshot
Pitfalls and Best Practices in Algorithm Configuration
inferred← citeshttps://doi.org/10.1613/jair.4726openalex-snapshot
AutoFolio: An Automatically Configured Algorithm Selector
inferred← citeshttps://doi.org/10.24963/ijcai.2017/80openalex-snapshot
From Decimation to Local Search and Back: A New Approach to MaxSAT
inferred← citeshttps://doi.org/10.3233/aic-140606openalex-snapshot
The CADE-24 automated theorem proving system competition – CASC-24
inferred← citeshttps://doi.org/10.3233/aic-220244openalex-snapshot
The 11th IJCAR automated theorem proving system competition – CASC-J11
inferred← citeshttps://doi.org/10.3233/aic-230325openalex-snapshot
The CADE-29 Automated Theorem Proving System Competition – CASC-29
inferred← citeshttps://doi.org/10.3233/sat190122openalex-snapshot
QBFRelay, QRATPre+, and DepQBF: Incremental Preprocessing Meets Search-Based QBF Solving
inferred← citeshttps://doi.org/10.4204/eptcs.229.12openalex-snapshot
The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results
inferred← citeshttps://doi.org/10.4230/lipics.cp.2021.8openalex-snapshot
Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper)
inferred← citeshttps://doi.org/10.4230/lipics.iclp.2012.164openalex-snapshot
Surviving Solver Sensitivity: An ASP Practitioner’s Guide
inferred← citeshttps://doi.org/10.48550/arxiv.1803.09566openalex-snapshot
BoSy: An Experimentation Framework for Bounded Synthesis
inferred← citeshttps://doi.org/10.48550/arxiv.1904.07736openalex-snapshot
The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results
inferred← citeshttps://doi.org/10.70675/02d252baz9d82z4712zaf2dz5e20b7e4b5cfopenalex-snapshot
Solveurs de contraintes autonomes
inferred← citeshttps://doi.org/10.70675/adbba29czefedz4ad5zb321z6fbb66d9c5f7openalex-snapshot
Optimization of passenger flows and resources management through machine learning and constraint programming techniques
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.