On the public citation graph
The Sat4j library, release 2.2
0 signed · 427 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.1007/11554844_3openalex-snapshot
Feature Models, Grammars, and Propositional Formulas
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-72788-0_28openalex-snapshot
A Lightweight Component Caching Scheme for Satisfiability Solvers
inferredcites →https://doi.org/10.1007/978-3-540-89439-1_2openalex-snapshot
Efficient Generation of Unsatisfiability Proofs and Cores in SAT
inferredcites →https://doi.org/10.1007/978-3-642-02777-2_23openalex-snapshot
Minimizing Learned Clauses
inferredcites →https://doi.org/10.1109/tcad.2004.842808openalex-snapshot
A fast pseudo-Boolean constraint solver
inferredcites →https://doi.org/10.1109/tcbb.2007.70254openalex-snapshot
Search for Steady States of Piecewise-Linear Differential Equation Models of Genetic Regulatory Networks
inferredcites →https://doi.org/10.1145/1595800.1595805openalex-snapshot
Dependency management for the eclipse ecosystem
inferredcites →https://doi.org/10.1145/775832.776041openalex-snapshot
A fast pseudo-boolean constraint solver
inferredcites →https://doi.org/10.1145/776038.776041openalex-snapshot
A fast pseudo-boolean constraint solver
inferredcites →https://doi.org/10.5555/777092.777190openalex-snapshot
Inference methods for a pseudo-boolean satisfiability solver
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/smr.1734openalex-snapshot
An optimization‐based tool to support the cost‐effective production of software architecture documentation
inferred← citeshttps://doi.org/10.1002/stvr.1566openalex-snapshot
Automated metamorphic testing of variability analysis tools
inferred← citeshttps://doi.org/10.1007/978-3-030-16722-6_25openalex-snapshot
Automatically Identifying Sufficient Object Builders from Module APIs
inferred← citeshttps://doi.org/10.1007/978-3-030-19212-9_3openalex-snapshot
Core-Boosted Linear Search for Incomplete MaxSAT
inferred← citeshttps://doi.org/10.1007/978-3-030-20323-8_5openalex-snapshot
Improving SAT Solving Using Monte Carlo Tree Search-Based Clause Learning
inferred← citeshttps://doi.org/10.1007/978-3-030-22102-7_29openalex-snapshot
Automating Automated Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-030-24258-9_17openalex-snapshot
DRMaxSAT with MaxHS: First Contact
inferred← citeshttps://doi.org/10.1007/978-3-030-29026-9_20openalex-snapshot
Herbrand Constructivization for Automated Intuitionistic Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-030-30048-7_11openalex-snapshot
Techniques Inspired by Local Search for Incomplete MaxSAT and the Linear Algorithm: Varying Resolution and Solution-Guided Search
inferred← citeshttps://doi.org/10.1007/978-3-030-41964-6_17openalex-snapshot
A Simple yet Efficient MCSes Enumeration with SAT Oracles
inferred← citeshttps://doi.org/10.1007/978-3-030-46970-2_12openalex-snapshot
Analysis of Discrete Models for Ecosystem Ecology
inferred← citeshttps://doi.org/10.1007/978-3-030-48077-6_4openalex-snapshot
Formal Verification of Interoperability Between Future Network Architectures Using Alloy
inferred← citeshttps://doi.org/10.1007/978-3-030-48077-6_8openalex-snapshot
Analysing ProB’s Constraint Solving Backends
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_20openalex-snapshot
Abstract Cores in Implicit Hitting Set MaxSat Solving
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_23openalex-snapshot
On Weakening Strategies for PB Solvers
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_36openalex-snapshot
Incremental Encoding of Pseudo-Boolean Goal Functions Based on Comparator Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_10openalex-snapshot
Watched Propagation of $$0$$-$$1$$ Integer Linear Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_6openalex-snapshot
Pure MaxSAT and Its Applications to Combinatorial Optimization via Linear Local Search
inferred← citeshttps://doi.org/10.1007/978-3-030-64881-7_3openalex-snapshot
Giving a Model-Based Testing Language a Formal Semantics via Partial MAX-SAT
inferred← citeshttps://doi.org/10.1007/978-3-030-68028-2_9openalex-snapshot
Efficient Symbolic Routing Encoding for In-vehicle Network Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-80223-3_1openalex-snapshot
OptiLog: A Framework for SAT-based Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-80223-3_22openalex-snapshot
On Dedicated CDCL Strategies for PB Solvers
inferred← citeshttps://doi.org/10.1007/978-3-031-38499-8_1openalex-snapshot
Certified Core-Guided MaxSAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-031-42697-1_12openalex-snapshot
SAF: SAT-Based Attractor Finder in Asynchronous Automata Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-60599-4_1openalex-snapshot
Core Boosting in SAT-Based Multi-objective Optimization
inferred← citeshttps://doi.org/10.1007/978-3-031-61007-3_28openalex-snapshot
Technology-Aware Enterprise Modeling: Challenging the Model-Driven Architecture Paradigm
inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_24openalex-snapshot
Certified MaxSAT Preprocessing
inferred← citeshttps://doi.org/10.1007/978-3-032-16761-3_20openalex-snapshot
Comparative Evaluation of Similarity-Based Prioritization Techniques in Search-Based Test Case Generation for Software Product Lines
inferred← citeshttps://doi.org/10.1007/978-3-032-39892-5_3openalex-snapshot
A Neuro-Symbolic Framework for Logic Puzzle Solving: Pseudo-Boolean Reasoning with LLM-Based Explanations
inferred← citeshttps://doi.org/10.1007/978-3-319-04915-1_13openalex-snapshot
Checking Internal Consistency of SOFL Specification: A Hybrid Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-05032-4_9openalex-snapshot
SMT-Constrained Symbolic Execution for Eclipse CDT/Codan
inferred← citeshttps://doi.org/10.1007/978-3-319-06859-6_20openalex-snapshot
Management of Variability in Modular Ontology Development
inferred← citeshttps://doi.org/10.1007/978-3-319-07046-9_19openalex-snapshot
SAT and Hybrid Models of the Car Sequencing Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-07046-9_22openalex-snapshot
Proteus: A Hierarchical Portfolio of Solvers and Transformations
inferred← citeshttps://doi.org/10.1007/978-3-319-07953-0_19openalex-snapshot
Inference of Boolean Networks from Gene Interaction Graphs Using a SAT Solver
inferred← citeshttps://doi.org/10.1007/978-3-319-08016-1_5openalex-snapshot
Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-08587-6_13openalex-snapshot
Proving Termination of Programs Automatically with AProVE
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_10openalex-snapshot
Long Proofs of (Seemingly) Simple Formulas
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_2openalex-snapshot
Cores in Core Based MaxSat Algorithms: An Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_33openalex-snapshot
Open-WBO: A Modular MaxSAT Solver,
inferred← citeshttps://doi.org/10.1007/978-3-319-09940-8_4openalex-snapshot
Producing Just Enough Documentation: The Next SAD Version Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_63openalex-snapshot
Air Traffic Controller Shift Scheduling by Reduction to CSP, SAT and SAT-Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-11245-9_2openalex-snapshot
A SAT-Based Debugging Tool for State Machines and Sequence Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-319-11558-0_52openalex-snapshot
Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-17533-1_1openalex-snapshot
Operating System Security Policy Hardening via Capability Dependency Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-19647-3_13openalex-snapshot
Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-23219-5_15openalex-snapshot
Generalized Totalizer Encoding for Pseudo-Boolean Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-23264-5_44openalex-snapshot
The Design of the Sixth Answer Set Programming Competition
inferred← citeshttps://doi.org/10.1007/978-3-319-23404-5_16openalex-snapshot
Parallel SAT-Based Parameterised Three-Valued Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-24255-2_21openalex-snapshot
Automatic Architecture Hardening Using Safety Patterns
inferred← citeshttps://doi.org/10.1007/978-3-319-25156-1_7openalex-snapshot
Matching and Merging Scenarios Automatically with Alloy
inferred← citeshttps://doi.org/10.1007/978-3-319-25423-4_16openalex-snapshot
A Logical Approach for Behavioural Composition of Scenario-Based Models
inferred← citeshttps://doi.org/10.1007/978-3-319-29473-5_2openalex-snapshot
Instantiation Reduction in Iterative Parameterised Three-Valued Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-32859-1_52openalex-snapshot
Optimal Coverage in Automotive Configuration
inferred← citeshttps://doi.org/10.1007/978-3-319-40229-1_33openalex-snapshot
Gen2sat: An Automated Tool for Deciding Derivability in Analytic Pure Sequent Calculi
inferred← citeshttps://doi.org/10.1007/978-3-319-40566-7_7openalex-snapshot
Constructing Markov Logic Networks from First-Order Default Rules
inferred← citeshttps://doi.org/10.1007/978-3-319-41540-6_7openalex-snapshot
Liveness of Randomised Parameterised Systems under Arbitrary Schedulers
inferred← citeshttps://doi.org/10.1007/978-3-319-49815-7_12openalex-snapshot
A Bounded Model Checker for Three-Valued Abstractions of Concurrent Software Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-56994-9_31openalex-snapshot
Solving MaxSAT by Successive Calls to a SAT Solver
inferred← citeshttps://doi.org/10.1007/978-3-319-63516-3_3openalex-snapshot
Parallel Maximum Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-319-66263-3_11openalex-snapshot
On Tackling the Limits of Resolution in SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-66263-3_13openalex-snapshot
Introducing Pareto Minimal Correction Subsets
inferred← citeshttps://doi.org/10.1007/978-3-319-66263-3_30openalex-snapshot
CNFgen: A Generator of Crafted Benchmarks
inferred← citeshttps://doi.org/10.1007/978-3-319-68288-4_11openalex-snapshot
Zooming in on Ontologies: Minimal Modules and Best Excerpts
inferred← citeshttps://doi.org/10.1007/978-3-319-68972-2_16openalex-snapshot
Model Checking of Concurrent Software Systems via Heuristic-Guided SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-75396-6_16openalex-snapshot
Towards the Automated Generation of Consistent, Diverse, Scalable and Realistic Graph Models
inferred← citeshttps://doi.org/10.1007/978-3-319-78090-0_11openalex-snapshot
Pruning Hypothesis Spaces Using Learned Domain Theories
inferred← citeshttps://doi.org/10.1007/978-3-319-89363-1_13openalex-snapshot
Iterative Generation of Diverse Models for Testing Specifications of DSL Tools
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_18openalex-snapshot
In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_4openalex-snapshot
Solving MaxSAT with Bit-Vector Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_5openalex-snapshot
Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-94205-6_1openalex-snapshot
An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-98334-9_15openalex-snapshot
Approximation Strategies for Incomplete MaxSAT
inferred← citeshttps://doi.org/10.1007/978-3-642-19718-5_6openalex-snapshot
Transfer Function Synthesis without Quantifier Elimination
inferred← citeshttps://doi.org/10.1007/978-3-642-21350-2_10openalex-snapshot
Satoulouse: The Computational Power of Propositional Logic Shown to Beginners
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_10openalex-snapshot
How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_13openalex-snapshot
Minimally Unsatisfiable Boolean Circuits
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_14openalex-snapshot
On Improving MUS Extraction Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-21952-8_15openalex-snapshot
Location Types for Safe Distributed Object-Oriented Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-22438-6_26openalex-snapshot
Cutting to the Chase Solving Linear Integer Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-642-22546-8_1openalex-snapshot
Rule-Based Activity Recognition in Ambient Intelligence
inferred← citeshttps://doi.org/10.1007/978-3-642-22655-7_16openalex-snapshot
Tunable Static Inference for Generic Universe Types
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_19openalex-snapshot
Solving MAXSAT by Solving a Sequence of Simpler SAT Instances
inferred← citeshttps://doi.org/10.1007/978-3-642-25167-2_6openalex-snapshot
Using Constraint Optimization for Conflict Resolution and Detail Control in Activity Recognition
inferred← citeshttps://doi.org/10.1007/978-3-642-30353-1_10openalex-snapshot
Preference-Based Planning via MaxSAT
inferred← citeshttps://doi.org/10.1007/978-3-642-30353-1_8openalex-snapshot
An Empirical Study of Encodings for Group MaxSAT
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_34openalex-snapshot
Coprocessor 2.0 – A Flexible CNF Simplifier
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_37openalex-snapshot
Azucar: A SAT-Based CSP Solver Using Compact Order Encoding
inferred← citeshttps://doi.org/10.1007/978-3-642-33353-8_37openalex-snapshot
DebateWEL: An Interface for Debating with Enthymemes and Logical Formulas
inferred← citeshttps://doi.org/10.1007/978-3-642-34413-8_35openalex-snapshot
Lower Bounds and Upper Bounds for MaxSAT
inferred← citeshttps://doi.org/10.1007/978-3-642-35182-2_16openalex-snapshot
A Synchronous Language with Partial Delay Specification for Real-Time Systems Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-35758-9_16openalex-snapshot
Verification of Item Usage Rules in Product Configuration
inferred← citeshttps://doi.org/10.1007/978-3-642-36946-9_16openalex-snapshot
Location Types for Safe Programming with Near and Far References
inferred← citeshttps://doi.org/10.1007/978-3-642-38493-6_15openalex-snapshot
Interactive Interaction Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-38709-8_19openalex-snapshot
Formal Methods for Exchange Policy Specification
inferred← citeshttps://doi.org/10.1007/978-3-642-38721-0_8openalex-snapshot
Overview of Matching Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_13openalex-snapshot
Exploiting the Power of mip Solvers in maxsat
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_19openalex-snapshot
Quantified Maximum Satisfiability:
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_34openalex-snapshot
Scarab: A Rapid Prototyping Tool for SAT-Based Constraint Programming Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-39091-3_27openalex-snapshot
A Reasoning Platform Based on the MI Shapley Inconsistency Value
inferred← citeshttps://doi.org/10.1007/978-3-642-39611-3_14openalex-snapshot
Automated Reencoding of Boolean Formulas
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_21openalex-snapshot
Postponing Optimization to Speed Up MAXSAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-41010-9_13openalex-snapshot
Specification and Verification Using Alloy of Optimistic Access Control for Distributed Collaborative Editors
inferred← citeshttps://doi.org/10.1007/978-3-642-41533-3_14openalex-snapshot
An Approach to Testing Java Implementation against Its UML Class Model
inferred← citeshttps://doi.org/10.1007/978-3-662-49122-5_22openalex-snapshot
Regular Symmetry Patterns
inferred← citeshttps://doi.org/10.1007/978-3-662-49665-7_10openalex-snapshot
Mind the Gap! Automated Anomaly Detection for Potentially Unbounded Cardinality-Based Feature Models
inferred← citeshttps://doi.org/10.1007/978-3-662-49665-7_6openalex-snapshot
Iterative and Incremental Model Generation by Logic Solvers
inferred← citeshttps://doi.org/10.1007/978-3-662-54577-5_23openalex-snapshot
autoCode4: Structural Controller Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-662-63079-2_2openalex-snapshot
Extensible Structural Analysis of Petri Net Product Lines
inferred← citeshttps://doi.org/10.1007/978-94-017-7267-9_8openalex-snapshot
Hybrid Optimization Techniques for System-Level Design Space Exploration
inferred← citeshttps://doi.org/10.1007/978-981-10-7356-4_6openalex-snapshot
Hybrid Mapping for Increased Security
inferred← citeshttps://doi.org/10.1007/978-981-16-2765-1_44openalex-snapshot
Meta-diagnosis via Preference Relaxation for State Trackability
inferred← citeshttps://doi.org/10.1007/s10009-019-00530-6openalex-snapshot
Diversity of graph models and graph generators in mutation testing
inferred← citeshttps://doi.org/10.1007/s10270-016-0575-4openalex-snapshot
Lessons learned from developing mbeddr: a case study in language engineering with MPS
inferred← citeshttps://doi.org/10.1007/s10270-017-0641-6openalex-snapshot
Enabling automated requirements reuse and configuration
inferred← citeshttps://doi.org/10.1007/s10270-020-00849-8openalex-snapshot
A formal approach to finding inconsistencies in a metamodel
inferred← citeshttps://doi.org/10.1007/s10270-021-00884-zopenalex-snapshot
Automated generation of consistent, diverse and structurally realistic graph models
inferred← citeshttps://doi.org/10.1007/s10270-021-00889-8openalex-snapshot
Guided architecture trade space exploration: fusing model-based engineering and design by shopping
inferred← citeshttps://doi.org/10.1007/s10462-022-10377-0openalex-snapshot
Interpretable decision trees through MaxSAT
inferred← citeshttps://doi.org/10.1007/s10479-017-2693-yopenalex-snapshot
Modeling and solving staff scheduling with partial weighted maxSAT
inferred← citeshttps://doi.org/10.1007/s10489-020-01998-5openalex-snapshot
Core-guided method for constraint-based multi-objective combinatorial optimization
inferred← citeshttps://doi.org/10.1007/s10515-012-0117-4openalex-snapshot
C2O configurator: a tool for guided decision-making
inferred← citeshttps://doi.org/10.1007/s10515-022-00329-xopenalex-snapshot
Identification and visualization of variability implementations in object-oriented variability-rich systems: a symmetry-based approach
inferred← citeshttps://doi.org/10.1007/s10601-012-9121-3openalex-snapshot
An overview of parallel SAT solving
inferred← citeshttps://doi.org/10.1007/s10601-012-9130-2openalex-snapshot
Reformulation based MaxSAT robustness
inferred← citeshttps://doi.org/10.1007/s10601-013-9146-2openalex-snapshot
Iterative and core-guided MaxSAT solving: A survey and assessment
inferred← citeshttps://doi.org/10.1007/s10601-015-9195-9openalex-snapshot
Quantified maximum satisfiability
inferred← citeshttps://doi.org/10.1007/s10601-015-9207-9openalex-snapshot
Parallel search for maximum satisfiability
inferred← citeshttps://doi.org/10.1007/s10601-018-9295-4openalex-snapshot
Improved WPM encoding for coalition structure generation under MC-nets
inferred← citeshttps://doi.org/10.1007/s10601-018-9299-0openalex-snapshot
N-level Modulo-Based CNF encodings of Pseudo-Boolean constraints for MaxSAT
inferred← citeshttps://doi.org/10.1007/s10601-020-09318-xopenalex-snapshot
Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search
inferred← citeshttps://doi.org/10.1007/s10617-012-9102-1openalex-snapshot
Symbolic system-level design methodology for multi-mode reconfigurable systems
inferred← citeshttps://doi.org/10.1007/s10664-019-09761-2openalex-snapshot
Going deeper with optimal software products selection using many-objective optimization and satisfiability solvers
inferred← citeshttps://doi.org/10.1007/s10664-020-09856-1openalex-snapshot
Data-driven software design with Constraint Oriented Multi-variate Bandit Optimization (COMBO)
inferred← citeshttps://doi.org/10.1007/s10664-020-09912-wopenalex-snapshot
Learning by sampling: learning behavioral family models from software product lines
inferred← citeshttps://doi.org/10.1007/s10664-022-10265-9openalex-snapshot
Evaluating state-of-the-art # SAT solvers on industrial configuration spaces
inferred← citeshttps://doi.org/10.1007/s10732-018-9386-9openalex-snapshot
Combining simulated annealing with local search heuristic for MAX-SAT
inferred← citeshttps://doi.org/10.1007/s10732-018-9400-2openalex-snapshot
Virtual machine consolidation using constraint-based multi-objective optimization
inferred← citeshttps://doi.org/10.1007/s10732-022-09495-3openalex-snapshot
Incomplete MaxSAT approaches for combinatorial testing
inferred← citeshttps://doi.org/10.1007/s10817-016-9388-yopenalex-snapshot
Analyzing Program Termination and Complexity Automatically with AProVE
inferred← citeshttps://doi.org/10.1007/s10817-026-09749-wopenalex-snapshot
Unsatisfiability-based Algorithms for Multi-Objective Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/s10844-016-0422-7openalex-snapshot
Constraint-based and SAT-based diagnosis of automotive configuration problems
inferred← citeshttps://doi.org/10.1007/s10844-021-00675-4openalex-snapshot
Explanations for over-constrained problems using QuickXPlain with speculative executions
inferred← citeshttps://doi.org/10.1007/s10878-015-9877-7openalex-snapshot
Algorithms for the workflow satisfiability problem engineered for counting constraints
inferred← citeshttps://doi.org/10.1007/s10951-022-00737-7openalex-snapshot
Pseudo-Boolean optimisation for RobinX sports timetabling
inferred← citeshttps://doi.org/10.1007/s11222-015-9611-4openalex-snapshot
Learning discrete decomposable graphical models via constraint optimization
inferred← citeshttps://doi.org/10.1007/s11390-013-1325-5openalex-snapshot
A Taxonomy of Exact Methods for Partial Max-SAT
inferred← citeshttps://doi.org/10.1007/s12652-013-0183-xopenalex-snapshot
SAT based enforcement of domotic effects in smart environments
inferred← citeshttps://doi.org/10.1007/s12652-020-02247-wopenalex-snapshot
Computation of minimal unsatisfiable subformulas for SAT-based digital circuit error diagnosis
inferred← citeshttps://doi.org/10.1007/s13740-015-0053-0openalex-snapshot
Producing Just Enough Documentation: An Optimization Approach Applied to the Software Architecture Domain
inferred← citeshttps://doi.org/10.1016/j.apal.2026.103808openalex-snapshot
Completeness of interpolation algorithms in classical and non-classical logics
inferred← citeshttps://doi.org/10.1016/j.artint.2015.08.004openalex-snapshot
Coalition structure generation: A survey
inferred← citeshttps://doi.org/10.1016/j.artint.2015.12.006openalex-snapshot
MaxSAT by improved instance-specific algorithm configuration
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.09.006openalex-snapshot
The Configurable SAT Solver Challenge (CSSC)
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.2020.103354openalex-snapshot
Old techniques in new ways: Clause weighting, unit propagation and hybridization for maximum satisfiability
inferred← citeshttps://doi.org/10.1016/j.automatica.2020.108920openalex-snapshot
Securing state reconstruction under sensor and actuator attacks: Theory and design
inferred← citeshttps://doi.org/10.1016/j.cl.2015.08.003openalex-snapshot
Intra- and interdiagram consistency checking of behavioral multiview models
inferred← citeshttps://doi.org/10.1016/j.cogsys.2018.09.008openalex-snapshot
Logical lateration – A cognitive systems experiment towards a new approach to the grounding problem
inferred← citeshttps://doi.org/10.1016/j.compind.2016.06.001openalex-snapshot
VOAuth: A solution to protect OAuth against phishing
inferred← citeshttps://doi.org/10.1016/j.cor.2016.08.004openalex-snapshot
MaxSAT-based large neighborhood search for high school timetabling
inferred← citeshttps://doi.org/10.1016/j.cor.2025.107195openalex-snapshot
Solving weighted Maximum Satisfiability with Branch and Bound and clause learning
inferred← citeshttps://doi.org/10.1016/j.dam.2012.05.028openalex-snapshot
Generalized k -ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation
inferred← citeshttps://doi.org/10.1016/j.entcs.2018.03.017openalex-snapshot
A Symbolic Decision Procedure for Symbolic Alternating Finite Automata
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104637openalex-snapshot
Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way
inferred← citeshttps://doi.org/10.1016/j.infsof.2011.06.008openalex-snapshot
Generating minimal fault detecting test suites for general Boolean specifications
inferred← citeshttps://doi.org/10.1016/j.infsof.2018.07.005openalex-snapshot
Feature location benchmark for extractive software product line adoption research using realistic and synthetic Eclipse variants
inferred← citeshttps://doi.org/10.1016/j.jisa.2020.102471openalex-snapshot
Measuring cyber-physical security in industrial control systems via minimum-effort attack strategies
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.03.003openalex-snapshot
Modal transition system encoding of featured transition systems
inferred← citeshttps://doi.org/10.1016/j.jss.2016.02.028openalex-snapshot
Self-adaptation in software-intensive cyber–physical systems: From system goals to architecture configurations
inferred← citeshttps://doi.org/10.1016/j.jss.2018.12.028openalex-snapshot
Minimum/maximum delay testing of product lines with unbounded parametric real-time constraints
inferred← citeshttps://doi.org/10.1016/j.scico.2019.02.002openalex-snapshot
Three-valued bounded model checking with cause-guided abstraction refinement
inferred← citeshttps://doi.org/10.1016/j.sysarc.2012.11.003openalex-snapshot
Modeling and efficient solving of extra-functional properties for adaptation in networked embedded real-time systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.08.015openalex-snapshot
Synthesis of a DNF formula from a sample of strings using Ehrenfeucht–Fraïssé games
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.01.038openalex-snapshot
A model of random industrial SAT
inferred← citeshttps://doi.org/10.1017/s0890060415000487openalex-snapshot
Formulating constraint satisfaction problems for the inspection of configuration rules
inferred← citeshttps://doi.org/10.1017/s1471068411000147openalex-snapshot
SAT-based termination analysis using monotonicity constraints over the integers
inferred← citeshttps://doi.org/10.1017/s1471068415000265openalex-snapshot
Optimizing phylogenetic supertrees using answer set programming
inferred← citeshttps://doi.org/10.1038/s41598-024-61647-6openalex-snapshot
Speculative computing for AAFM solutions in large-scale product configurations
inferred← citeshttps://doi.org/10.1080/0952813x.2014.993508openalex-snapshot
Improving linear search algorithms with model-based approaches for MaxSAT solving
inferred← citeshttps://doi.org/10.1080/0952813x.2017.1409278openalex-snapshot
PDDL4J: a planning domain description library for java
inferred← citeshttps://doi.org/10.1093/comjnl/bxv001openalex-snapshot
How to Optimize the Use of SAT and SMT Solvers for Test Generation of Boolean Expressions
inferred← citeshttps://doi.org/10.1093/comjnl/bxz063openalex-snapshot
NuDist: An Efficient Local Search Algorithm for (Weighted) Partial MaxSAT
inferred← citeshttps://doi.org/10.1109/acc.2015.7171925openalex-snapshot
Sound and complete state estimation for linear dynamical systems under sensor attacks using Satisfiability Modulo Theory solving
inferred← citeshttps://doi.org/10.1109/access.2021.3085911openalex-snapshot
SMT-Based Consistency Checking of Configuration-Based Components Specifications
inferred← citeshttps://doi.org/10.1109/ase.2011.6100079openalex-snapshot
Optimizing the automatic test generation by SAT and SMT solving for Boolean expressions
inferred← citeshttps://doi.org/10.1109/ase63991.2025.00113openalex-snapshot
Efficient and Verifiable Proof Logging for MaxSAT Solving
inferred← citeshttps://doi.org/10.1109/ase63991.2025.00187openalex-snapshot
Automated Repair of OpenID Connect Programs
inferred← citeshttps://doi.org/10.1109/aspdac.2013.6509558openalex-snapshot
Schedule integration for time-triggered systems
inferred← citeshttps://doi.org/10.1109/cdc.2016.7799298openalex-snapshot
Scalable lazy SMT-based motion planning
inferred← citeshttps://doi.org/10.1109/cdc.2017.8263659openalex-snapshot
An SMT-based approach to secure state estimation under sensor and actuator attacks
inferred← citeshttps://doi.org/10.1109/ciml69155.2026.11692810openalex-snapshot
Diverse Sampling from Configurable Software Systems via Automatically Extracted Features
inferred← citeshttps://doi.org/10.1109/codes-isss.2013.6659011openalex-snapshot
IVaM: Implicit variant modeling and management for automotive embedded systems
inferred← citeshttps://doi.org/10.1109/edcc.2016.25openalex-snapshot
Adaptive Deployment Infrastructure for Android Applications
inferred← citeshttps://doi.org/10.1109/fmcad.2013.6679390openalex-snapshot
Computing prime implicants
inferred← citeshttps://doi.org/10.1109/fpt.2011.6132693openalex-snapshot
Operational mode exploration for reconfigurable systems with multiple applications
showing the first 200 of 415 · page through all 415
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.