scientific article; zbMATH DE number 5493266
From MaRDI portal
Publication:5503674
General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00) Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in artificial intelligence (68T27)
Recommendations
- Handbook of satisfiability. In 2 parts
- scientific article; zbMATH DE number 1222558
- Handbook of computability theory
- Satisfiability checking: theory and applications
- scientific article; zbMATH DE number 1705882
- Handbook of proof theory
- scientific article; zbMATH DE number 193479
- A Tutorial on Satisfiability Modulo Theories
- Handbook of computability and complexity in analysis
Cited in
(only showing first 100 items - show all)- P\(_-\)UNSAT approach of attractor calculation for Boolean gene regulatory networks
- maxSAT-based large neighborhood search for high school timetabling
- A branch-and-price algorithm for the minimum latency problem
- A verified SAT solver framework with learn, forget, restart, and incrementality
- Minimal sets on propositional formulae. Problems and reductions
- Causal effect identification in acyclic directed mixed graphs and gated models
- A constraint optimization approach to causal discovery from subsampled time series data
- Automatically improving constraint models in Savile Row
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
- Gate elimination: circuit size lower bounds and \#SAT upper bounds
- The air traffic controller work-shift scheduling problem in Spain from a multiobjective perspective: a metaheuristic and regular expression-based approach
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
- Modeling and solving staff scheduling with partial weighted maxSAT
- Autark assignments of Horn CNFs
- Generalized probabilistic satisfiability
- Intra- and interdiagram consistency checking of behavioral multiview models
- Conflict-driven answer set solving: from theory to practice
- Understanding cutting planes for QBFs
- Selecting and covering colored points
- Fuzzy relational equations with min-biimplication composition
- Modular instantiation schemes
- Special issues on The satisfiability problem (pp. 1--244) including papers from the 1st workshop on satisfiability, Certosa di Pontignano, Italy, April 29--May 3, 1996 and Boolean functions (pp. 245--479)
- Counterexample-guided inductive synthesis for probabilistic systems
- Lower bound techniques for QBF expansion
- Computation of the transient in max-plus linear systems via SMT-solving
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
- N-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
- A formal methods approach to predicting new features of the eukaryotic vesicle traffic system
- \textit{Branch} \& \textit{memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees
- Building strategies into QBF proofs
- Probabilistic characterization of random Max r-Sat
- Pruning external minimality checking for answer set programs using semantic dependencies
- The opacity of backbones
- Generalized completeness for SOS resolution and its application to a new notion of relevance
- SAT encodings for pseudo-Boolean constraints together with at-most-one constraints
- Propagation complete encodings of smooth DNNF theories
- Using the method of conditional expectations to supply an improved starting point for CCLS
- Solving bitvectors with MCSAT: explanations from bits and pieces
- Scalable algorithms for abduction via enumerative syntax-guided synthesis
- A posthumous contribution by Larry Wos: excerpts from an unpublished column
- Theorem proving as constraint solving with coherent logic
- An efficient subsumption test pipeline for BS(LRA) clauses
- Semantic relevance
- SCL(EQ): SCL for first-order logic with equality
- Ranking with multiple reference points: efficient SAT-based learning procedures
- On some variants of the merging variables based (1+1)-evolutionary algorithm with application to MaxSAT problem
- Efficient all-UIP learned clause minimization
- Investigating the existence of Costas Latin squares via satisfiability testing
- Projection heuristics for binary branchings between sum and product
- On dedicated CDCL strategies for PB solvers
- A fast algorithm for SAT in terms of formula length
- A refined branching algorithm for the maximum satisfiability problem
- Automated generation of exam sheets for automated deduction
- Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version
- CEGAR-tableaux: improved modal satisfiability via modal clause-learning and SAT
- Eliminating models during model elimination
- Reducing Boolean networks with backward Boolean equivalence
- The sample analysis machine scheduling problem: definition and comparison of exact solving approaches
- A novel algorithm for Max Sat calling MOCE to order
- A parameterized view on the complexity of dependence logic
- Related-tweakey impossible differential attack on reduced-round \texttt{SKINNY-AEAD} M1/M3
- Careful synchronization of partial deterministic finite automata
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference
- First-order automated reasoning with theories: when deduction modulo theory meets practice
- Efficient strategies for CEGAR-based model checking
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results
- New ways to multiply \(3 \times 3\)-matrices
- Faradžev Read-type enumeration of non-isomorphic CC systems
- Local search with a SAT oracle for combinatorial optimization
- New width parameters for SAT and \#SAT
- Acceptance in incomplete argumentation frameworks
- Propositional proof systems based on maximum satisfiability
- Minimal self-similar Peano curve of genus \(5 \times 5\)
- On the complexity of reconstructing chemical reaction networks
- Zeon and idem-Clifford formulations of Boolean satisfiability
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games
- New models for generating hard random Boolean formulas and disjunctive logic programs
- How we designed winning algorithms for abstract argumentation and which insight we attained
- The SAT+CAS method for combinatorial search with applications to best matrices
- Continuous relaxations for the traveling salesman problem
- Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- Conflict-driven satisfiability for theory combination: transition system and completeness
- Definability for model counting
- Reactive synthesis with maximum realizability of linear temporal logic specifications
- Using decomposition-parameters for QBF: mind the prefix!
- Editorial: Symbolic computation and satisfiability checking
- Cylindrical algebraic decomposition with equational constraints
- A complete and terminating approach to linear integer solving
- Applying computer algebra systems with SAT solvers to the Williamson conjecture
- On the complexity of inconsistency measurement
- Reinterpreting dependency schemes: soundness meets incompleteness in DQBF
- Hyperresolution for Gödel logic with truth constants
- Improved WPM encoding for coalition structure generation under MC-nets
- Expansion-based QBF solving versus Q-resolution
- Methods for solving reasoning problems in abstract argumentation -- a survey
- meSAT: multiple encodings of CSP to SAT
- Generalising unit-refutation completeness and SLUR via nested input resolution
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures
- On preprocessing techniques and their impact on propositional model counting
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5503674)
