scientific article

Publication date: 30 August 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066105825423

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (48)

Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way ⋮ Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving ⋮ Interpolation and model checking for nonlinear arithmetic ⋮ Progress in certifying hardware model checking results ⋮ ASP Solving for Expanding Universes ⋮ Gearing Up for Effective ASP Planning ⋮ Hints Revealed ⋮ Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API ⋮ Conformant planning as a case study of incremental QBF solving ⋮ On black-box optimization in divide-and-conquer SAT solving ⋮ Incremental bounded model checking for embedded software ⋮ Symmetry in Gardens of Eden ⋮ SAT-based optimal classification trees for non-binary data ⋮ Combining incomplete search and clause generation: an application to the orienteering problems with time windows ⋮ Synchronous counting and computational algorithm design ⋮ State identification and verification with satisfaction ⋮ 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 ⋮ Unnamed Item ⋮ Incremental preprocessing methods for use in BMC ⋮ Algorithms for computing minimal equivalent subformulas ⋮ Computing Storyline Visualizations with Few Block Crossings ⋮ \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming ⋮ Planning as satisfiability: parallel plans and algorithms for plan search ⋮ Invariant Checking of NRA Transition Systems via Incremental Reduction to LRA with EUF ⋮ Faster Extraction of High-Level Minimal Unsatisfiable Cores ⋮ Finding Effective SAT Partitionings Via Black-Box Optimization ⋮ The incremental satisfiability problem for a two conjunctive normal form ⋮ SAT solver management strategies in IC3: an experimental approach ⋮ Conflict-driven answer set solving: from theory to practice ⋮ Ricochet Robots Reloaded: A Case-Study in Multi-shot ASP Solving ⋮ SampleSearch: importance sampling in presence of determinism ⋮ FSM inference from long traces ⋮ Multi-shot ASP solving with clingo ⋮ Unnamed Item ⋮ SAT-Based Model Checking without Unrolling ⋮ Strengthening Induction-Based Race Checking with Lightweight Static Analysis ⋮ Finding Finite Models in Multi-sorted First-Order Logic ⋮ Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP ⋮ SAT competition 2020 ⋮ Automatic analysis of DMA races using model checking and \(k\)-induction ⋮ Engineering an Incremental ASP Solver ⋮ Interpolant Learning and Reuse in SAT-Based Model Checking ⋮ Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores ⋮ On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving ⋮ MiFuMax—a Literate MaxSAT Solver ⋮ RC2: an Efficient MaxSAT Solver

Uses Software

This page was built for publication: