Handbook of Knowledge Representation

Knowledge Representation, which lies at the core of Artificial Intelligence, is concerned with encoding knowledge on computers to enable systems to reason automatically. The Handbook of Knowledge Representation is an up-to-date review of twenty-five key topics in knowledge representation, written by the leaders of each field.This book is an essential resource for students, researchers and practitioners in all areas of Artificial Intelligence. * Make your computer smarter* Handle qualitative and uncertain information* Improve computational tractability to solve your problems easily

[1]  William J. Cook,et al.  On the complexity of cutting-plane proofs , 1987, Discret. Appl. Math..

[2]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[3]  Bart Selman,et al.  Survey Propagation Revisited , 2007, UAI.

[4]  Andrei A. Bulatov,et al.  A dichotomy theorem for constraints on a three-element set , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[5]  Vladimir Lifschitz,et al.  Pointwise circumscription , 1987 .

[6]  Mark Abramson,et al.  Executing Reactive, Model-based Programs through Graph-based Temporal Planning , 2001, IJCAI.

[7]  J. Finger,et al.  Exploiting constraints in design synthesis , 1987 .

[8]  E. Friedgut,et al.  Sharp thresholds of graph properties, and the -sat problem , 1999 .

[9]  Gilles Dequen,et al.  A backbone-search heuristic for efficient solving of hard 3-SAT formulae , 2001, IJCAI.

[10]  Peter Struss.  What's in SD?: Towards a theory of modeling for diagnosis , 1992 .

[11]  Hans K. Buning,et al.  Propositional Logic: Deduction and Algorithms , 1999 .

[12]  D. Dennett.  The Intentional Stance. , 1987 .

[13]  Fahiem Bacchus,et al.  Effective Preprocessing with Hyper-Resolution and Equality Reduction , 2003, SAT.

[14]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 2002, JACM.

[15]  Bart Selman,et al.  Evidence for Invariants in Local Search , 1997, AAAI/IAAI.

[16]  Barbara M. Smith,et al.  Symmetry Breaking in Graceful Graphs , 2003, CP.

[17]  Meinolf Sellmann,et al.  Streamlined Constraint Reasoning , 2004, CP.

[18]  Michael Wooldridge,et al.  On the logic of coalitional games , 2006, AAMAS '06.

[19]  Patrick Prosser,et al.  HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..

[20]  Yoav Shoham,et al.  Chronological Ignorance: Experiments in Nonmonotonic Temporal Reasoning , 1988, Artif. Intell..

[21]  Marie-Odile Cordier,et al.  COMPARING DIAGNOSABILITY IN CS AND DES , 2006 .

[22]  Michael Thielscher,et al.  Ramification and Causality , 1997, Artif. Intell..

[23]  Erik Aurell,et al.  Comparing Beliefs, Surveys, and Random Walks , 2004, NIPS.

[24]  David Zuckerman,et al.  Optimal speedup of Las Vegas algorithms , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[25]  Bruce A. Reed,et al.  Mick gets some (the odds are on his side) (satisfiability) , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[26]  Georg Gottlob,et al.  Formalizing the repair process , 1992 .

[27]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[28]  Dimitris Achlioptas,et al.  Optimal myopic algorithms for random 3-SAT , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[29]  Rina Dechter,et al.  Bucket Elimination: A Unifying Framework for Reasoning , 1999, Artif. Intell..

[30]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[31]  Kiziltan Zeynep,et al.  Constraint Programming with Multisets , 2002 .

[32]  Peter Struss,et al.  Model-Based Diagnosis with the Default-Based Diagnosis Engine: Effective Control Strategies that Work in Practice , 1994, ECAI.

[33]  Thomas Stützle,et al.  SATLIB: An Online Resource for Research on SAT , 2000 .

[34]  Makoto Yokoo,et al.  Distributed Constraint Satisfaction: Foundations of Cooperation in Multi-agent Systems , 2000 .

[35]  S. Prestwich.  Local Search and Backtracking vs Non-Systematic Backtracking , 2001 .

[36]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[37]  Moshe Y. Vardi,et al.  Symbolic Decision Procedures for QBF , 2004, CP.

[38]  Fangzhen Lin,et al.  Embracing Causality in Specifying the Indirect Effects of Actions , 1995, IJCAI.

[39]  Hudson Turner,et al.  Causal Theories of Action and Change , 1997, AAAI/IAAI.

[40]  Solomon W. Golomb,et al.  Backtrack Programming , 1965, JACM.

[41]  Bernhard Nebel,et al.  Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra , 1994, JACM.

[42]  John Franco,et al.  Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem , 1983, Discret. Appl. Math..

[43]  François Laburthe,et al.  Improved CLP Scheduling with Task Intervals , 1994, ICLP.

[44]  Inês Lynce,et al.  An Overview of Backtrack Search Satisfiability Algorithms , 2003, Annals of Mathematics and Artificial Intelligence.

[45]  David G. Mitchell,et al.  Finding hard instances of the satisfiability problem: A survey , 1996, Satisfiability Problem: Theory and Applications.

[46]  Steve Linton,et al.  Generic SBDD Using Computational Group Theory , 2003, CP.

[47]  Toby Walsh,et al.  Breaking Row and Column Symmetries in Matrix Models , 2002, CP.

[48]  Peter Struss.  Fundamentals of Model-Based Diagnosis of Dynamic Systems , 1997, IJCAI.

[49]  Krzysztof R. Apt,et al.  Principles of constraint programming , 2003 .

[50]  Maria Luisa Bonet,et al.  Optimality of size-width tradeoffs for resolution , 2001, computational complexity.

[51]  David Maxwell Chickering,et al.  A Bayesian Approach to Tackling Hard Computational Problems (Preliminary Report) , 2001, Electron. Notes Discret. Math..

[52]  Edwin P. D. Pednault,et al.  ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.

[53]  Henry A. Kautz,et al.  Algorithmic applications of propositional proof complexity , 2005 .

[54]  Joao Marques-Silva,et al.  Robust search algorithms for test pattern generation , 1997, Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing.

[55]  J. Hooker,et al.  Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction , 2000 .

[56]  Tad Hogg,et al.  Expected Gains from Parallelizing Constraint Solving for Hard Problems , 1994, AAAI.

[57]  Jussi Rintanen,et al.  Improvements to the Evaluation of Quantified Boolean Formulae , 1999, IJCAI.

[58]  Gerald J. Sussman,et al.  Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis , 1976, Artif. Intell..

[59]  Jörg P. Müller,et al.  A Pragmatic BDI Architecture , 1997, ATAL.

[60]  Bart Selman,et al.  Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

[61]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[62]  Gautam Biswas,et al.  Model-Based Diagnosis of Hybrid Systems , 2003, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[63]  Riccardo Zecchina,et al.  Survey propagation as local equilibrium equations , 2003, ArXiv.

[64]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[65]  Fahiem Bacchus,et al.  Using temporal logics to express search control knowledge for planning , 2000, Artif. Intell..

[66]  David Harel,et al.  First-Order Dynamic Logic , 1979, Lecture Notes in Computer Science.

[67]  Andreas Kuehlmann,et al.  A fast pseudo-Boolean constraint solver , 2003, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[68]  Eugene C. Freuder.  Synthesizing constraint expressions , 1978, CACM.

[69]  James M. Crawford,et al.  Symmetry-Breaking Predicates for Search Problems , 1996, KR.

[70]  Ulrich Heller,et al.  Process-oriented consistency-based diagnosis - theory, implementation and applications , 2001, DISKI.

[71]  Endre Szemerédi,et al.  Many hard examples for resolution , 1988, JACM.

[72]  Hector J. Levesque,et al.  Rational interaction as the basis for communication , 2003 .

[73]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[74]  Eero Hyvönen,et al.  Constraint Reasoning Based on Interval Arithmetic , 1989, IJCAI.

[75]  Fangzhen Lin,et al.  State Constraints Revisited , 1994, J. Log. Comput..

[76]  Makoto Yokoo,et al.  Weak-Commitment Search for Solving Constraint Satisfaction Problems , 1994, AAAI.

[77]  Lakhdar Sais,et al.  Recovering and Exploiting Structural Knowledge from CNF Formulas , 2002, CP.

[78]  Thomas A. Henzinger,et al.  Reactive Modules , 1999, Formal Methods Syst. Des..

[79]  Jimmy Ho-Man Lee,et al.  Breaking value symmetries in matrix models using channeling constraints , 2005, SAC '05.

[80]  Holger H. Hoos,et al.  An adaptive noise mechanism for walkSAT , 2002, AAAI/IAAI.

[81]  Jean-François Puget,et al.  Breaking All Value Symmetries in Surjection Problems , 2005, CP.

[82]  Martin J. Wainwright,et al.  A new look at survey propagation and its generalizations , 2004, SODA '05.

[83]  V. Goranko.  Coalition games and alternating temporal logics , 2001 .

[84]  Roberto J. Bayardo,et al.  Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.

[85]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[86]  Ernest Davis,et al.  Constraint Propagation with Interval Labels , 1987, Artif. Intell..

[87]  Peter Struss,et al.  AUTAS: A Tool for Supporting FMECA Generation in Aeronautic Systems , 2004, ECAI.

[88]  Demosthenis Teneketzis,et al.  Active diagnosis of discrete-event systems , 1998 .

[89]  Javier Larrosa,et al.  Exploiting the Use of DAC in MAX-CSP , 1996, CP.

[90]  Mauricio G. C. Resende,et al.  Computational experience with an interior point algorithm on the satisfiability problem , 1990, IPCO.

[91]  Hector J. Levesque,et al.  The Tractability of Subsumption in Frame-Based Description Languages , 1984, AAAI.

[92]  Enn Tyugu,et al.  Constraint Programming , 1994, NATO ASI Series.

[93]  Reinhold Letz,et al.  Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas , 2002, TABLEAUX.

[94]  Bart Selman,et al.  Formal Models of Heavy-Tailed Behavior in Combinatorial Search , 2001, CP.

[95]  Amy L. Lansky,et al.  Reactive Reasoning and Planning , 1987, AAAI.

[96]  John McCarthy,et al.  Actions and Other Events in Situation Calculus , 2002, KR.

[97]  Gerhard Friedrich,et al.  Diagnosing Temporal Misbehavior , 1991, IJCAI.

[98]  Vijay A. Saraswat,et al.  Concurrent constraint programming , 1989, POPL '90.

[99]  Adnan Darwiche,et al.  Compiling Devices: A Structure-Based Approach , 1998, KR.

[100]  Brian C. Williams,et al.  Diagnosing Multiple Faults , 1987, Artif. Intell..

[101]  Koen V. Hindriks,et al.  Agent Programming in 3APL , 1999, Autonomous Agents and Multi-Agent Systems.

[102]  Hector J. Levesque,et al.  Intention is Choice with Commitment , 1990, Artif. Intell..

[103]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[104]  Pieter J. Mosterman,et al.  A comprehensive methodology for building hybrid models of physical systems , 2000, Artif. Intell..

[105]  Jussi Rintanen.  Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae , 2001, LPAR.

[106]  Christer Bäckström,et al.  A Unifying Approach to Temporal Constraint Reasoning , 1998, Artif. Intell..

[107]  Jimmy Ho-Man Lee,et al.  Increasing Constraint Propagation by Redundant Modeling: an Experience Report , 1999, Constraints.

[108]  Bart Selman,et al.  Model Counting: A New Strategy for Obtaining Good Bounds , 2006, AAAI.

[109]  Armin Biere,et al.  Resolve and Expand , 2004, SAT.

[110]  Thomas A. Henzinger,et al.  MOCHA: Modularity in Model Checking , 1998, CAV.

[111]  Peter Gärdenfors,et al.  On the logic of theory change: Partial meet contraction and revision functions , 1985, Journal of Symbolic Logic.

[112]  Michael Wooldridge,et al.  Temporal qualitative coalitional games , 2006, AAMAS '06.

[113]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..

[114]  Boi Faltings,et al.  A Scalable Method for Multiagent Constraint Optimization , 2005, IJCAI.

[115]  Raymond Reiter,et al.  Characterizing Diagnoses and Systems , 1992, Artif. Intell..

[116]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[117]  Toby Walsh,et al.  Towards an Understanding of Hill-Climbing Procedures for SAT , 1993, AAAI.

[118]  Drew McDermott,et al.  Nonmonotonic Logic and Temporal Projection , 1987, Artif. Intell..

[119]  Chris J. Price.  Autosteve: Automated Electrical Design Analysis , 2000, ECAI.

[120]  Zohar Manna,et al.  The Deductive Synthesis of Imperative LISP Programs , 1987, AAAI.

[121]  Rémi Monasson,et al.  Determining computational complexity from characteristic ‘phase transitions’ , 1999, Nature.

[122]  Martin C. Cooper,et al.  Tractable Constraints on Ordered Domains , 1995, Artif. Intell..

[123]  Chu Min Li,et al.  Integrating Equivalency Reasoning into Davis-Putnam Procedure , 2000, AAAI/IAAI.

[124]  Alan M. Frieze,et al.  Analysis of Two Simple Heuristics on a Random Instance of k-SAT , 1996, J. Algorithms.

[125]  Masahiro Fujita,et al.  Symbolic model checking using SAT procedures instead of BDDs , 1999, DAC '99.

[126]  Julia Galliers,et al.  A Strategic Framework for Multi-Agent Cooperative Dialogue , 1988, ECAI.

[127]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[128]  Ying Sun,et al.  A Framework for Model-Based Repair , 1993, AAAI.

[129]  Matthew L. Ginsberg,et al.  Dynamic Backtracking , 1993, J. Artif. Intell. Res..

[130]  Lefteris M. Kirousis,et al.  The probabilistic analysis of a greedy satisfiability algorithm , 2002, Random Struct. Algorithms.

[131]  Kenneth D. Forbus.  Qualitative Process Theory , 1984, Artif. Intell..

[132]  Maria Fox,et al.  The Detection and Exploitation of Symmetry in Planning Problems , 1999, IJCAI.

[133]  Michael Gelfond,et al.  Diagnostic reasoning with A-Prolog , 2003, Theory Pract. Log. Program..

[134]  J. Köbler,et al.  The Graph Isomorphism Problem: Its Structural Complexity , 1993 .

[135]  Fangzhen Lin,et al.  Rules as Actions: A Situation Calculus Semantics for Logic Programs , 1997, J. Log. Program..

[136]  Gianfranco Lamperti,et al.  Diagnosis of active systems : principles and techniques , 2003 .

[137]  Assaf Naor,et al.  Rigorous location of phase transitions in hard optimization problems , 2005, Nature.

[138]  Bart Selman,et al.  The Achilles' Heel of QBF , 2005, AAAI.

[139]  Toby Walsh,et al.  Easy Problems are Sometimes Hard , 1994, Artif. Intell..

[140]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[141]  Peter Struss,et al.  "Physical Negation" Integrating Fault Models into the General Diagnostic Engine , 1989, IJCAI.

[142]  Fangzhen Lin,et al.  Search Algorithms in the Situation Calculus , 1999 .

[143]  Jean-Charles Régin,et al.  A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[144]  Georg Gottlob,et al.  Physical Impossibility Instead of Fault Models , 1990, AAAI.

[145]  David Poole,et al.  Normality and Faults in Logic-Based Diagnosis , 1989, IJCAI.

[146]  Koen V. Hindriks,et al.  A Formal Embedding of AgentSpeak(L) in 3APL , 1998, Australian Joint Conference on Artificial Intelligence.

[147]  Steven David Prestwich,et al.  Variable Dependency in Local Search: Prevention Is Better Than Cure , 2007, SAT.

[148]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[149]  Hector J. Levesque,et al.  Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[150]  Eugene C. Freuder,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[151]  Pascal Van Hentenryck.  The OPL optimization programming language , 1999 .

[152]  Martin C. Cooper.  High-Order Consistency in Valued Constraint Satisfaction , 2005, Constraints.

[153]  Toby Walsh,et al.  An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem , 1996, CP.

[154]  Didier Dubois,et al.  Fuzzy constraints in job-shop scheduling , 1995, J. Intell. Manuf..

[155]  Joxan Jaffar,et al.  Constraint logic programming , 1987, POPL '87.

[156]  Henry A. Kautz,et al.  Constraint Propagation Algorithms for Temporal Reasoning , 1986, AAAI.

[157]  Thom W. Frühwirth,et al.  Theory and Practice of Constraint Handling Rules , 1998, J. Log. Program..

[158]  Wiebe van der Hoek,et al.  Formalizing Potential of Agents: The KARO Framework Revisited , 2000 .

[159]  Brian C. Williams,et al.  Diagnosis with Behavioral Modes , 1989, IJCAI.

[160]  Johan de Kleer,et al.  Fundamentals of model-based diagnosis , 2003 .

[161]  Yves Deville,et al.  CP(Graph): Introducing a Graph Computation Domain in Constraint Programming , 2005, CP.

[162]  Raymond Reiter,et al.  The Frame Problem in the Situation Calculus: A Simple Solution (Sometimes) and a Completeness Result for Goal Regression , 1991, Artificial and Mathematical Theory of Computation.

[163]  Abdul Sattar,et al.  Building Structure into Local Search for SAT , 2007, IJCAI.

[164]  Francesca Rossi,et al.  Constraint Solving over Semirings , 1995, IJCAI.

[165]  C.H. Papadimitriou,et al.  On selecting a satisfying truth assignment , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[166]  Christian Bessiere,et al.  Statistical Regimes Across Constrainedness Regions , 2004, CP.

[167]  Balakrishnan Krishnamurthy.  Short proofs for tricky formulas , 2004, Acta Informatica.

[168]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[169]  Toby Walsh,et al.  Using Auxiliary Variables and Implied Constraints to Model Non-Binary Problems , 2000, AAAI/IAAI.

[170]  David J. Israel,et al.  Plans and resource‐bounded practical reasoning , 1988, Comput. Intell..

[171]  Igor L. Markov,et al.  Exploiting structure in symmetry detection for CNF , 2004, Proceedings. 41st Design Automation Conference, 2004..

[172]  Marco Benedetti,et al.  sKizzo: A Suite to Evaluate and Certify QBFs , 2005, CADE.

[173]  Bart Selman,et al.  Computational science: Can get satisfaction , 2005, Nature.

[174]  Alain Colmerauer,et al.  An introduction to Prolog III , 1989, CACM.

[175]  Roger Mohr,et al.  Good Old Discrete Relaxation , 1988, ECAI.

[176]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[177]  Ian P. Gent,et al.  Symmetry Breaking in Constraint Programming , 2000, ECAI.

[178]  Daniel P. Miranker,et al.  A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem , 1996, AAAI/IAAI, Vol. 1.

[179]  John W. Collins.  Process-based diagnosis: an approach to understanding novel failures , 1994 .

[180]  Peter Struss,et al.  Model-Based Systems in the Automotive Industry , 2004, AI Mag..

[181]  Robert Milne,et al.  Gas-Turbine Condition Monitoring Using Qualitative Model-Based Diagnosis , 1997, IEEE Expert.

[182]  Alan M. Frieze,et al.  On the satisfiability and maximum satisfiability of random 3-CNF formulas , 1993, SODA '93.

[183]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

[184]  V. Lifschitz.  Formal theories of action , 1987 .

[185]  C. Cordell Green,et al.  Application of Theorem Proving to Problem Solving , 1969, IJCAI.

[186]  Leon Sterling,et al.  The Art of Prolog , 1987, IEEE Expert.

[187]  Thomas Schiex,et al.  Selecting preferred solutions in Fuzzy Constraint Satisfaction Problems , 1993 .

[188]  Randall Davis,et al.  Expert Systems: Where Are We? And Where Do We Go from Here? , 1982, AI Mag..

[189]  Raymond Reiter,et al.  Some contributions to the metatheory of the situation calculus , 1999, JACM.

[190]  Roland H. C. Yap,et al.  The CLP( R ) language and system , 1992, TOPL.

[191]  Raymond Reiter,et al.  Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems , 2001 .

[192]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[193]  Michael R. Genesereth,et al.  The Use of Design Descriptions in Automated Diagnosis , 1984, Artif. Intell..

[194]  David E. Smith,et al.  Reasoning About Action II: The Qualification Problem , 1988, Artif. Intell..

[195]  Francesca Rossi,et al.  Semiring-based constraint solving and optimization , 1997 .

[196]  Lakhdar Sais,et al.  Boosting complete techniques thanks to local search methods , 1998, Annals of Mathematics and Artificial Intelligence.

[197]  Georg Gottlob,et al.  A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.

[198]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[199]  Anthony G. Cohn,et al.  Qualitative Reasoning , 1987, Advanced Topics in Artificial Intelligence.

[200]  Grigoris Antoniou,et al.  Nonmonotonic reasoning , 1997 .

[201]  Peter van Beek,et al.  Constraint tightness and looseness versus local and global consistency , 1997, JACM.

[202]  Jussi Rintanen,et al.  Constructing Conditional Plans by a Theorem-Prover , 1999, J. Artif. Intell. Res..

[203]  Toby Walsh,et al.  Consistency and Propagation with Multiset Constraints: A Formal Viewpoint , 2003, CP.

[204]  Michela Milano,et al.  Global Cut Framework for Removing Symmetries , 2001, CP.

[205]  Jean-Charles Régin,et al.  Generalized Arc Consistency for Global Cardinality Constraint , 1996, AAAI/IAAI, Vol. 1.

[206]  Peter Struss,et al.  Back to Defatilts: Characterizing and Computing Diagnoses as Coherent Assumption Sets , 1992, ECAI.

[207]  Roland H. C. Yap,et al.  An optimal coarse-grained arc consistency algorithm , 2005, Artif. Intell..

[208]  Meinolf Sellmann,et al.  Symmetry Breaking , 2001, CP.

[209]  Hector J. Levesque,et al.  GOLOG: A Logic Programming Language for Dynamic Domains , 1997, J. Log. Program..

[210]  Nicolas Beldiceanu,et al.  Arc-Consistency for a Chain of Lexicographic Ordering Constraints , 2002 .

[211]  Dan Roth,et al.  On the Hardness of Approximate Reasoning , 1993, IJCAI.

[212]  Michael Tiller,et al.  Introduction to Physical Modeling with Modelica , 2001 .

[213]  Mark D. Johnston,et al.  A discrete stochastic neural network algorithm for constraint satisfaction problems , 1990, 1990 IJCNN International Joint Conference on Neural Networks.

[214]  Pascal Van Hentenryck,et al.  The Constraint Logic Programming Language CHIP , 1988, FGCS.

[215]  Manolis Koubarakis,et al.  Backtracking algorithms for disjunctions of temporal constraints , 1998, Artif. Intell..

[216]  Toby Walsh,et al.  Global Constraints for Lexicographic Orderings , 2002, CP.

[217]  P. A. Geelen,et al.  Dual Viewpoint Heuristics for Binary Constraint Satisfaction Problems , 1992, ECAI.

[218]  Fangzhen Lin,et al.  Applications of the Situation Calculus To Formalizing Control and Strategy Information: The Prolog Cut Operator , 1997, IJCAI.

[219]  Eugene Goldberg,et al.  BerkMin: A Fast and Robust Sat-Solver , 2002 .

[220]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..

[221]  Rina Dechter,et al.  Network-Based Heuristics for Constraint-Satisfaction Problems , 1987, Artif. Intell..

[222]  Carmen Gervet,et al.  Interval propagation to reason about sets: Definition and implementation of a practical language , 1997, Constraints.

[223]  Rina Dechter,et al.  Learning While Searching in Constraint-Satisfaction-Problems , 1986, AAAI.

[224]  Federico Ricci-Tersenghi,et al.  On the solution-space geometry of random constraint satisfaction problems , 2006, STOC '06.

[225]  Pierre Marquis,et al.  A Knowledge Compilation Map , 2002, J. Artif. Intell. Res..

[226]  John McCarthy,et al.  Epistemological Problems of Artificial Intelligence , 1987, IJCAI.

[227]  Thomas Schiex,et al.  Nogood Recording for Static and Dynamic Constraint Satisfaction Problems , 1994, Int. J. Artif. Intell. Tools.

[228]  Randall Davis,et al.  Diagnostic Reasoning Based on Structure and Behavior , 1984, Artif. Intell..

[229]  Marie-Odile Cordier,et al.  A formal framework for the decentralised diagnosis of large scale discrete event systems and its application to telecommunication networks , 2005, Artif. Intell..

[230]  Michael J. Maher,et al.  Constraint Logic Programming: A Survey , 1994, J. Log. Program..

[231]  Matthew L. Ginsberg,et al.  Readings in Nonmonotonic Reasoning , 1987, AAAI 1987.

[232]  Robert J. Aumann,et al.  Interactive epistemology I: Knowledge , 1999, Int. J. Game Theory.

[233]  A. Baltag,et al.  Logics for epistemic programs , 2004 .

[234]  Markus Stumptner,et al.  Model-Based Diagnosis of Hardware Designs , 1999, Artif. Intell..

[235]  Boi Faltings,et al.  ODPOP: An Algorithm for Open/Distributed Constraint Optimization , 2006, AAAI.

[236]  Bart Selman,et al.  Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems , 1998, AIPS.

[237]  Michael Alekhnovich,et al.  An exponential separation between regular and general resolution , 2002, STOC '02.

[238]  Thomas Schiex,et al.  Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison , 1999, Constraints.

[239]  Fahiem Bacchus,et al.  Enhancing Davis Putnam with extended binary clause reasoning , 2002, AAAI/IAAI.

[240]  Toby Walsh,et al.  Search in a Small World , 1999, IJCAI.

[241]  John Franco.  Probabilistic analysis of the pure literal heuristic for the satisfiability problem , 1984, Ann. Oper. Res..

[242]  David A. McAllester,et al.  GSAT and Dynamic Backtracking , 1994, KR.

[243]  Michael Fisher,et al.  Temporal Representation and Reasoning , 2008, Handbook of Knowledge Representation.

[244]  Djamal Habet,et al.  A Hybrid Approach for SAT , 2002, CP.

[245]  P. Pandurang Nayak,et al.  Automated Modeling of Physical Systems , 1995, Lecture Notes in Computer Science.

[246]  Peter van Beek,et al.  On the Minimality and Decomposability of Constraint Networks , 1992, AAAI.

[247]  Holger H. Hoos,et al.  On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT , 1999, AAAI/IAAI.

[248]  Franz Wotawa,et al.  On the relationship between model-based debugging and program slicing , 2002, Artif. Intell..

[249]  Richard J. Wallace,et al.  Directed Arc Consistency Preprocessing , 1995, Constraint Processing, Selected Papers.

[250]  Jun Gu,et al.  Algorithms for the satisfiability (SAT) problem: A survey , 1996, Satisfiability Problem: Theory and Applications.

[251]  J. McCarthy.  Situations, Actions, and Causal Laws , 1963 .

[252]  Marc Gyssens,et al.  Closure properties of constraints , 1997, JACM.

[253]  Olivier Bernard,et al.  Experiment selection for the discrimination of semi-quantitative models of dynamical systems , 2006, Artif. Intell..

[254]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[255]  Fangzhen Lin,et al.  Provably correct theories of action , 1991, JACM.

[256]  Jean-François Puget,et al.  Dynamic Lex Constraints , 2006, CP.

[257]  Gilles Pesant,et al.  On Global Warming (Softening Global Constraints) , 2004, ArXiv.

[258]  Joao Marques-Silva,et al.  The Impact of Branching Heuristics in Propositional Satisfiability Algorithms , 1999, EPIA.

[259]  Thomas Schiex,et al.  Possibilistic Constraint Satisfaction Problems or "How to Handle Soft Constraints?" , 1992, UAI.

[260]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[261]  Brian F. Chellas.  Modal Logic: Normal systems of modal logic , 1980 .

[262]  Roberto J. Bayardo,et al.  Counting Models Using Connected Components , 2000, AAAI/IAAI.

[263]  Markus Stumptner,et al.  Extending diagnosis to debug programs with exceptions , 2003, 18th IEEE International Conference on Automated Software Engineering, 2003. Proceedings..

[264]  Naomi Nishimura,et al.  Detecting Backdoor Sets with Respect to Horn and Binary Clauses , 2004, SAT.

[265]  Yasushi Umeda,et al.  A design methodology for a self-maintenance machine based on functional redundancy , 1992 .

[266]  Martin C. Cooper,et al.  Arc consistency for soft constraints , 2004, Artif. Intell..

[267]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[268]  Marc Gyssens,et al.  How to Determine the Expressive Power of Constraints , 1999, Constraints.

[269]  Christian Bessiere,et al.  MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems , 1996, CP.

[270]  Mark A. Brown.  On the logic of ability , 1988, J. Philos. Log..

[271]  P. Pandurang Nayak,et al.  A Model-Based Approach to Reactive Self-Configuring Systems , 1996, AAAI/IAAI, Vol. 2.

[272]  E. A. Hirsch,et al.  UnitWalk: A New SAT Solver that Uses Local Search Guided by Unit Clause Elimination , 2005 .

[273]  Peter Struss.  A MODEL-BASED METHODOLOGY FOR THE INTEGRATION OF DIAGNOSIS AND FAULT ANALYSIS DURING THE ENTIRE LIFE CYCLE , 2006 .

[274]  Cristopher Moore,et al.  How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails , 2004, CP.

[275]  Johan de Kleer,et al.  Compiling devices: locality in a TMS , 1993 .

[276]  Alan K. Mackworth.  On Reading Sketch Maps , 1977, IJCAI.

[277]  Rina Dechter,et al.  Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition , 1990, Artif. Intell..

[278]  Eric Horvitz,et al.  Dynamic restart policies , 2002, AAAI/IAAI.

[279]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[280]  Christian Bessiere,et al.  Meta-constraints on violations for over constrained problems , 2000, Proceedings 12th IEEE Internationals Conference on Tools with Artificial Intelligence. ICTAI 2000.

[281]  Fangzhen Lin,et al.  Compiling Causal Theories to Successor State Axioms and STRIPS-Like Systems , 2003, J. Artif. Intell. Res..

[282]  M. Mézard,et al.  Analytic and Algorithmic Solution of Random Satisfiability Problems , 2002, Science.

[283]  Johan de Kleer,et al.  Readings in qualitative reasoning about physical systems , 1990 .

[284]  Franz Wotawa,et al.  Fundamentals of Debugging Using a Resolution Calculus , 2006, FASE.

[285]  Benjamin Kuipers,et al.  Model-Based Monitoring of Dynamic Systems , 1989, IJCAI.

[286]  Nicolas Beldiceanu,et al.  Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type , 2000, CP.

[287]  Gilles Dequen,et al.  kcnfs: An Efficient Solver for Random k-SAT Formulae , 2003, SAT.

[288]  Ronald J. Brachman,et al.  An overview of the KL-ONE Knowledge Representation System , 1985 .

[289]  Igor Mozetic,et al.  Hierarchical Model-Based Diagnosis , 1991, Int. J. Man Mach. Stud..

[290]  Peter Struss,et al.  Task-dependent qualitative domain abstraction , 2005, Artif. Intell..

[291]  Jean-François Puget,et al.  On the Satisfiability of Symmetrical Constrained Satisfaction Problems , 1993, ISMIS.

[292]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

[293]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[294]  Raymond Reiter,et al.  On tests for hypothetical reasoning , 1992 .