Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
From MaRDI portal
Publication:1244202
DOI10.1016/0004-3702(77)90029-7zbMath0372.94024OpenAlexW2038118137MaRDI QIDQ1244202
Richard M. Stallman, Gerald J. Sussman
Publication date: 1977
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/6255
Related Items
Experimental evaluation of preprocessing algorithms for constraint satisfaction problems, What we can learn from conflicts in propositional satisfiability, Propositional SAT Solving, Planning for conjunctive goals, A rational reconstruction of nonmonotonic truth maintenance systems, Network-based heuristics for constraint-satisfaction problems, A model for belief revision, The anomalous extension problem in default reasoning, The state of SAT, Conflict-directed \(A^{*}\) and its role in model-based embedded systems, Heuristic-based backtracking relaxation for propositional satisfiability, Automatic construction of accurate models of physical systems, Revision in ACMS, Propositional truth maintenance systems: Classification and complexity analysis, The satisfiability constraint gap, Refining the phase transition in combinatorial search, Symbolic reasoning among 3-D models and 2-D images, Non-monotonic logic. I, A conflict-directed approach to chance-constrained mixed logical linear programming, Domain reduction techniques for global NLP and MINLP optimization, An Expressive Model for Instance Decomposition Based Parallel SAT Solvers, Learning from conflicts in propositional satisfiability, Approximating minimal unsatisfiable subformulae by means of adaptive core search, A multiagent evolutionary algorithm with direct and indirect combined representation for constraint satisfaction problems, Constraint Integer Programming: A New Approach to Integrate CP and MIP, Formula dissection: A parallel algorithm for constraint satisfaction, CyclePad: An articulate virtual laboratory for engineering thermodynamics, Student proof exercises using MathsTiles and Isabelle/HOL in an intelligent book, DPLL: The Core of Modern Satisfiability Solvers, A general framework for reason maintenance, A theory of interactions: Unifying qualitative and quantitative algebraic reasoning, Generating Feasible Schedules for a Pick-up and Delivery Problem, Using an Incomplete Version of Dynamic Backtracking for Graph Colouring, Conflict analysis in mixed integer programming, Inference of regular languages using state merging algorithms with search, From systems to logic in the early development of nonmonotonic reasoning, Experiments with conflict analysis in mixed integer programming, Information-based branching schemes for binary linear mixed integer problems, The roles of associational and causal reasoning in problem solving., The Complexity of Propositional Proofs, Multi-agent oriented constraint satisfaction, Backjumping is Exception Handling, Electronic circuit diagnostic expert systems - a survey, Symbolic constraint handling through unification in finite algebras, Computational aspects of infeasibility analysis in mixed integer programming, On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning, Generating multiple new designs from a sketch, Salt: A knowledge acquisition language for propose-and-revise systems, SATO: An efficient propositional prover, Qualitative rigid-body mechanics, Conflict Analysis for MINLP, Toward unification of exact and heuristic optimization methods, Efficient Algorithms for Functional Constraints, Ordering conjunctive queries, Learning in order to avoid search in logic programming, Simulation of hybrid circuits in constraint logic programming, Models and emerging trends of concurrent constraint programming, Backjump-based backtracking for constraint satisfaction problems, Hybrid backtracking bounded by tree-decomposition of constraint networks
Uses Software
Cites Work
