Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
From MaRDI portal
Publication:1244202
Cites work
Cited in
(59)- Ordering conjunctive queries
- Planning for conjunctive goals
- Network-based heuristics for constraint-satisfaction problems
- A model for belief revision
- The anomalous extension problem in default reasoning
- Non-monotonic logic. I
- A general framework for reason maintenance
- A theory of interactions: Unifying qualitative and quantitative algebraic reasoning
- Electronic circuit diagnostic expert systems - a survey
- On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning
- Generating multiple new designs from a sketch
- Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
- Automatic construction of accurate models of physical systems
- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- Qualitative rigid-body mechanics
- Backjump-based backtracking for constraint satisfaction problems
- Domain reduction techniques for global NLP and MINLP optimization
- A multiagent evolutionary algorithm with direct and indirect combined representation for constraint satisfaction problems
- Salt: A knowledge acquisition language for propose-and-revise systems
- Propositional truth maintenance systems: Classification and complexity analysis
- CyclePad: An articulate virtual laboratory for engineering thermodynamics
- Experiments with conflict analysis in mixed integer programming
- Computational aspects of infeasibility analysis in mixed integer programming
- Information-based branching schemes for binary linear mixed integer problems
- Models and emerging trends of concurrent constraint programming
- Student proof exercises using MathsTiles and Isabelle/HOL in an intelligent book
- Conflict analysis in mixed integer programming
- Inference of regular languages using state merging algorithms with search
- What we can learn from conflicts in propositional satisfiability
- A rational reconstruction of nonmonotonic truth maintenance systems
- The state of SAT
- Conflict-directed \(A^{*}\) and its role in model-based embedded systems
- The satisfiability constraint gap
- Refining the phase transition in combinatorial search
- Symbolic reasoning among 3-D models and 2-D images
- Generating feasible schedules for a pick-up and delivery problem
- Using an incomplete version of dynamic backtracking for graph colouring
- An expressive model for instance decomposition based parallel SAT solvers
- Propositional SAT solving
- DPLL: the core of modern satisfiability solvers
- Revision in ACMS
- Learning from conflicts in propositional satisfiability
- Backjumping is Exception Handling
- Conflict Analysis for MINLP
- SATO: An efficient propositional prover
- Toward unification of exact and heuristic optimization methods
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- From systems to logic in the early development of nonmonotonic reasoning
- The Complexity of Propositional Proofs
- Efficient Algorithms for Functional Constraints
- Multi-agent oriented constraint satisfaction
- A conflict-directed approach to chance-constrained mixed logical linear programming
- Symbolic constraint handling through unification in finite algebras
- Learning in order to avoid search in logic programming
- Simulation of hybrid circuits in constraint logic programming
- Hybrid backtracking bounded by tree-decomposition of constraint networks
- Heuristic-based backtracking relaxation for propositional satisfiability
- Formula dissection: A parallel algorithm for constraint satisfaction
- The roles of associational and causal reasoning in problem solving.
This page was built for publication: Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1244202)
