Temporal induction by incremental SAT solving
From MaRDI portal
Recommendations
- Efficient Temporal Satisfiability
- Modelling and solving temporal reasoning as propositional satisfiability
- On Solving Soft Temporal Constraints Using SAT Techniques
- Temporal constraint satisfaction problems in fixed-point logic
- A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic
- Propositional temporal proving with reductions to a SAT problem
- Simplifying inductive schemes in temporal logic
- The complexity of temporal constraint satisfaction problems
- SAT-based induction for temporal safety properties
Cited in
(66)- Incremental bounded model checking for embedded software
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
- The incremental satisfiability problem for a two conjunctive normal form
- Conflict-driven answer set solving: from theory to practice
- FSM inference from long traces
- Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP
- SAT competition 2020
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving
- Conformant planning as a case study of incremental QBF solving
- Planning as satisfiability: parallel plans and algorithms for plan search
- Finding Finite Models in Multi-sorted First-Order Logic
- Using satisfiability modulo theories for inductive verification of Lustre programs
- SAT-based induction for temporal safety properties
- Interpolant learning and reuse in SAT-based model checking
- Gearing up for effective ASP planning
- ITSAT: An Efficient SAT-Based Temporal Planner
- Faster Extraction of High-Level Minimal Unsatisfiable Cores
- SAT-Based Model Checking without Unrolling
- Strengthening induction-based race checking with lightweight static analysis
- A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic
- Invariant checking of NRA transition systems via incremental reduction to LRA with EUF
- ASP solving for expanding universes
- Hints revealed
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
- Integrating Inductive Definitions in SAT
- Symmetry in Gardens of Eden
- Towards a notion of unsatisfiable and unrealizable cores for LTL
- Exploiting step semantics for efficient bounded model checking of asynchronous systems
- SAT-solving in CSP trace refinement
- Incremental preprocessing methods for use in BMC
- Algorithms for computing minimal equivalent subformulas
- Computing storyline visualizations with few block crossings
- Accelerated deletion-based extraction of minimal unsatisfiable cores
- On using incremental encodings in unsatisfiability-based MaxSAT solving
- MiFuMax -- a literate MaxSAT solver. System description
- RC2: an efficient MaxSAT solver
- On black-box optimization in divide-and-conquer SAT solving
- scientific article; zbMATH DE number 7199588 (Why is no real title available?)
- Finding Effective SAT Partitionings Via Black-Box Optimization
- Ricochet Robots reloaded: a case-study in multi-shot ASP solving
- Multi-shot ASP solving with clingo
- SAT solver management strategies in IC3: an experimental approach
- Boolean Abstraction for Temporal Logic Satisfiability
- SampleSearch: importance sampling in presence of determinism
- Correct Hardware Design and Verification Methods
- Engineering an Incremental ASP Solver
- SAT-based optimal classification trees for non-binary data
- Combining incomplete search and clause generation: an application to the orienteering problems with time windows
- CRNs exposed: a method for the systematic exploration of chemical reaction networks
- State identification and verification with satisfaction
- Propositional proof skeletons
- Solving string constraints using SAT
- On enumerating short projected models
- Unsatisfiability-based algorithms for multi-objective combinatorial optimization
- Towards universally accessible SAT technology
- Engineering and evaluating multi-objective pseudo-Boolean optimizers
- ICCMA 2023: 5th international competition on computational models of argumentation
- Certifying incremental SAT solving
- Satisfiability modulo user propagators
- Declarative approaches to outcome determination in judgment aggregation
- Multi-objective maximum satisfiability by single-objective implicit hitting set optimization
- Automatic analysis of DMA races using model checking and k-induction
- Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way
- Interpolation and model checking for nonlinear arithmetic
- Progress in certifying hardware model checking results
- Synchronous counting and computational algorithm design
This page was built for publication: Temporal induction by incremental SAT solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845506)
