Pages that link to "Item:Q1244202"

The following pages link to Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis (Q1244202):

Displaying 50 items.

• Learning from conflicts in propositional satisfiability (Q427560) (← links)
• From systems to logic in the early development of nonmonotonic reasoning (Q543606) (← links)
• Symbolic constraint handling through unification in finite algebras (Q757060) (← links)
• Learning in order to avoid search in logic programming (Q805265) (← links)
• Simulation of hybrid circuits in constraint logic programming (Q805302) (← links)
• Hybrid backtracking bounded by tree-decomposition of constraint networks (Q814455) (← links)
• Heuristic-based backtracking relaxation for propositional satisfiability (Q862398) (← links)
• Formula dissection: A parallel algorithm for constraint satisfaction (Q931750) (← links)
• The roles of associational and causal reasoning in problem solving. (Q989160) (← links)
• Ordering conjunctive queries (Q1060862) (← links)
• Planning for conjunctive goals (Q1101262) (← links)
• Network-based heuristics for constraint-satisfaction problems (Q1102137) (← links)
• A model for belief revision (Q1104127) (← links)
• The anomalous extension problem in default reasoning (Q1104922) (← links)
• Non-monotonic logic. I (Q1140441) (← links)
• A general framework for reason maintenance (Q1187218) (← links)
• A theory of interactions: Unifying qualitative and quantitative algebraic reasoning (Q1190523) (← links)
• Electronic circuit diagnostic expert systems - a survey (Q1262111) (← links)
• On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning (Q1274559) (← links)
• Generating multiple new designs from a sketch (Q1274685) (← links)
• Experimental evaluation of preprocessing algorithms for constraint satisfaction problems (Q1332852) (← links)
• Automatic construction of accurate models of physical systems (Q1380436) (← links)
• Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373) (← links)
• Qualitative rigid-body mechanics (Q1575179) (← links)
• Backjump-based backtracking for constraint satisfaction problems (Q1605408) (← links)
• Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
• A multiagent evolutionary algorithm with direct and indirect combined representation for constraint satisfaction problems (Q1701558) (← links)
• Salt: A knowledge acquisition language for propose-and-revise systems (Q1823730) (← links)
• Propositional truth maintenance systems: Classification and complexity analysis (Q1924776) (← links)
• CyclePad: An articulate virtual laboratory for engineering thermodynamics (Q1978463) (← links)
• Experiments with conflict analysis in mixed integer programming (Q2011593) (← links)
• Computational aspects of infeasibility analysis in mixed integer programming (Q2063195) (← links)
• Information-based branching schemes for binary linear mixed integer problems (Q2267352) (← links)
• Models and emerging trends of concurrent constraint programming (Q2348541) (← links)
• Student proof exercises using MathsTiles and Isabelle/HOL in an intelligent book (Q2462639) (← links)
• Conflict analysis in mixed integer programming (Q2471271) (← links)
• Inference of regular languages using state merging algorithms with search (Q2485087) (← links)
• What we can learn from conflicts in propositional satisfiability (Q2630816) (← links)
• A rational reconstruction of nonmonotonic truth maintenance systems (Q2638808) (← links)
• The state of SAT (Q2643296) (← links)
• Conflict-directed \(A^{*}\) and its role in model-based embedded systems (Q2643303) (← links)
• The satisfiability constraint gap (Q2674178) (← links)
• Refining the phase transition in combinatorial search (Q2674181) (← links)
• Symbolic reasoning among 3-D models and 2-D images (Q2676556) (← links)
• Generating feasible schedules for a pick-up and delivery problem (Q2741264) (← links)
• Using an incomplete version of dynamic backtracking for graph colouring (Q2741266) (← links)
• An Expressive Model for Instance Decomposition Based Parallel SAT Solvers (Q2964456) (← links)
• Propositional SAT Solving (Q3176367) (← links)
• DPLL: The Core of Modern Satisfiability Solvers (Q3305326) (← links)
• Revision in ACMS (Q4018177) (← links)