- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| i9 |      | Eric Horvitz, Yongshao Ruan, Carla P. Gomes, Henry A. Kautz, Bart Selman, David Maxwell Chickering: A Bayesian Approach to Tackling Hard Computational Problems. CoRR abs/1301.2279 (2013) |
| i8 | | Carla P. Gomes, Bart Selman: Algorithm Portfolio Design: Theory vs. Practice. CoRR abs/1302.1541 (2013) |
| i7 | | Stefano Ermon, Carla P. Gomes, Ashish Sabharwal, Bart Selman: Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization. CoRR abs/1302.6677 (2013) |
| 2012 | ||
| c108 | | Ronan LeBras, Carla P. Gomes, Bart Selman: From Streamlined Combinatorial Search to Efficient Constructive Procedures. AAAI 2012 |
| c107 | | Stefano Ermon, Carla P. Gomes, Bart Selman, Alexander Vladimirsky: Probabilistic planning with non-linear utility functions and worst-case guarantees. AAMAS 2012: 965-972 |
| c106 | | Jaeyong Sung, Colin Ponce, Bart Selman, Ashutosh Saxena: Unstructured human activity detection from RGBD images. ICRA 2012: 842-849 |
| c105 | | Stefano Ermon, Carla P. Gomes, Ashish Sabharwal, Bart Selman: Density Propagation and Improved Bounds on the Partition Function. NIPS 2012: 2771-2779 |
| c104 | | Stefano Ermon, Yexiang Xue, Carla P. Gomes, Bart Selman: Learning Policies for Battery Usage Optimization in Electric Vehicles. ECML/PKDD (2) 2012: 195-210 |
| c103 | | Stefano Ermon, Ronan LeBras, Carla P. Gomes, Bart Selman, R. Bruce van Dover: SMT-Aided Combinatorial Materials Discovery. SAT 2012: 172-185 |
| c102 | | Stefano Ermon, Carla P. Gomes, Bart Selman: Uniform Solution Sampling Using a Constraint Solver As an Oracle. UAI 2012: 255-264 |
| e2 |  | Jörg Hoffmann, Bart Selman (Eds.): Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada. AAAI Press 2012 |
| i6 | | Stefano Ermon, Jon Conrad, Carla P. Gomes, Bart Selman: Playing games against nature: optimal policies for renewable resource allocation. CoRR abs/1203.3478 (2012) |
| i5 | | Raghuram Ramanujan, Ashish Sabharwal, Bart Selman: Understanding Sampling Style Adversarial Search Methods. CoRR abs/1203.4011 (2012) |
| i4 | | |
| i3 | | Stefano Ermon, Carla P. Gomes, Bart Selman: Uniform Solution Sampling Using a Constraint Solver As an Oracle. CoRR abs/1210.4861 (2012) |
| 2011 | ||
| j31 | | Ashish Sabharwal, Bart Selman: S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Third Edition. Artif. Intell. 175(5-6): 935-937 (2011) |
| j30 | | Lukas Kroc, Ashish Sabharwal, Bart Selman: Leveraging belief propagation, backtrack search, and statistics for model counting. Annals OR 184(1): 209-231 (2011) |
| c101 | | Jaeyong Sung, Colin Ponce, Bart Selman, Ashutosh Saxena: Human Activity Detection from RGBD Images. Plan, Activity, and Intent Recognition 2011 |
| c100 | | Alessandro Previti, Raghuram Ramanujan, Marco Schaerf, Bart Selman: Monte-Carlo Style UCT Search for Boolean Satisfiability. AI*IA 2011: 177-188 |
| c99 | | |
| c98 | | Stefano Ermon, Carla P. Gomes, Bart Selman: A message passing approach to multiagent gaussian inference for dynamic processes. AAMAS 2011: 1277-1278 |
| c97 | | Stefano Ermon, Jon Conrad, Carla P. Gomes, Bart Selman: Risk-Sensitive Policies for Sustainable Renewable Resource Allocation. IJCAI 2011: 1942-1948 |
| c96 | | Stefano Ermon, Carla P. Gomes, Bart Selman: A Flat Histogram Method for Computing the Density of States of Combinatorial Problems. IJCAI 2011: 2608-2613 |
| c95 | | Stefano Ermon, Carla P. Gomes, Ashish Sabharwal, Bart Selman: Accelerated Adaptive Markov Chain for Partition Function Computation. NIPS 2011: 2744-2752 |
| c94 | | Alessandro Previti, Raghuram Ramanujan, Marco Schaerf, Bart Selman: Applying UCT to Boolean Satisfiability. SAT 2011: 373-374 |
| i2 | | Jaeyong Sung, Colin Ponce, Bart Selman, Ashutosh Saxena: Human Activity Detection from RGBD Images. CoRR abs/1107.0169 (2011) |
| 2010 | ||
| j29 | | Roberto Battiti, Bart Selman, Thomas Stützle: Special issue on learning and intelligent optimization. Ann. Math. Artif. Intell. 60(1-2): 1-2 (2010) |
| c93 | | Lukas Kroc, Ashish Sabharwal, Bart Selman: Approximate Inference for Clusters in Solution Spaces. Abstraction, Reformulation, and Approximation 2010 |
| c92 | | Raghuram Ramanujan, Ashish Sabharwal, Bart Selman: On Adversarial Search Spaces and Sampling-Based Planning. ICAPS 2010: 242-245 |
| c91 | | Stefano Ermon, Carla P. Gomes, Bart Selman: Collaborative multiagent Gaussian inference in a dynamic environment using belief propagation. AAMAS 2010: 1419-1420 |
| c90 | | Stefano Ermon, Carla P. Gomes, Bart Selman: Computing the Density of States of Boolean Formulas. CP 2010: 38-52 |
| c89 | | Lukas Kroc, Ashish Sabharwal, Bart Selman: An Empirical Study of Optimal Noise and Runtime Distributions in Local Search. SAT 2010: 346-351 |
| c88 | | Stefano Ermon, Jon Conrad, Carla P. Gomes, Bart Selman: Playing games against nature: optimal policies for renewable resource allocation. UAI 2010: 168-176 |
| c87 | | Raghuram Ramanujan, Ashish Sabharwal, Bart Selman: Understanding Sampling Style Adversarial Search Methods. UAI 2010: 474-483 |
| 2009 | ||
| c86 | | Lukas Kroc, Ashish Sabharwal, Carla P. Gomes, Bart Selman: Integrating Systematic and Local Search Paradigms: A New Strategy for MaxSAT. IJCAI 2009: 544-551 |
| c85 | | Lukas Kroc, Ashish Sabharwal, Bart Selman: Message-passing and local heuristics as decimation strategies for satisfiability. SAC 2009: 1408-1414 |
| c84 | | |
| p2 | | Henry A. Kautz, Ashish Sabharwal, Bart Selman: Incomplete Algorithms. Handbook of Satisfiability 2009: 185-203 |
| p1 | | Carla P. Gomes, Ashish Sabharwal, Bart Selman: Model Counting. Handbook of Satisfiability 2009: 633-654 |
| 2008 | ||
| c83 | | Lukas Kroc, Ashish Sabharwal, Bart Selman: Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting. CPAIOR 2008: 127-141 |
| c82 | | Lukas Kroc, Bart Selman, Ashish Sabharwal: Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting. ISAIM 2008 |
| c81 | | Lukas Kroc, Ashish Sabharwal, Bart Selman: Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation. NIPS 2008: 873-880 |
| 2007 | ||
| j28 | | Henry A. Kautz, Bart Selman: The state of SAT. Discrete Applied Mathematics 155(12): 1514-1524 (2007) |
| j27 | | Jörg Hoffmann, Carla P. Gomes, Bart Selman: Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning. Logical Methods in Computer Science 3(1) (2007) |
| j26 | | Ioannis A. Vetsikas, Bart Selman: Bayes-Nash equilibria for mth price auctions with multiple closing times. SIGecom Exchanges 6(2): 27-36 (2007) |
| c80 | | Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabharwal, Bart Selman: Counting CSP Solutions Using Generalized XOR Constraints. AAAI 2007: 204-209 |
| c79 | | Willem Jan van Hoeve, Carla P. Gomes, Bart Selman, Michele Lombardi: Optimal Multi-Agent Scheduling with Constraint Programming. AAAI 2007: 1813-1818 |
| c78 | | Yunsong Guo, Bart Selman: ExOpaque: A Framework to Explain Opaque Machine Learning Models Using Inductive Logic Programming. ICTAI (2) 2007: 226-229 |
| c77 | | Ioannis A. Vetsikas, Nicholas R. Jennings, Bart Selman: Generating Bayes-Nash Equilibria to Design Autonomous Trading Agents. IJCAI 2007: 1543-1550 |
| c76 | | Jörg Hoffmann, Carla P. Gomes, Bart Selman, Henry A. Kautz: SAT Encodings of State-Space Reachability Problems in Numeric Domains. IJCAI 2007: 1918-1923 |
| c75 | | Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, Bart Selman: From Sampling to Model Counting. IJCAI 2007: 2293-2299 |
| c74 | | Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, Bart Selman: Short XORs for Model Counting: From Theory to Practice. SAT 2007: 100-106 |
| c73 | | Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, Bart Selman: Sampling and Soundness: Can We Have Both? New Forms of Reasoning for the Semantic Web 2007 |
| c72 | | |
| i1 | | Jörg Hoffmann, Carla P. Gomes, Bart Selman: Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning. CoRR abs/cs/0701184 (2007) |
| 2006 | ||
| c71 | | Carla P. Gomes, Ashish Sabharwal, Bart Selman: Model Counting: A New Strategy for Obtaining Good Bounds. AAAI 2006: 54-61 |
| c70 | | Carla P. Gomes, Willem Jan van Hoeve, Bart Selman: Constraint Programming for Distributed Planning and Scheduling. AAAI Spring Symposium: Distributed Plan and Schedule Management 2006: 157-158 |
| c69 | | Jörg Hoffmann, Carla P. Gomes, Bart Selman: Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning. ICAPS 2006: 284-293 |
| c68 | | |
| c67 | | Yannet Interian, Gabriel Corvera, Bart Selman, Ryan Williams: Finding Small Unsatisfiable Cores to Prove Unsatisfiability of QBFs. ISAIM 2006 |
| c66 | | Carla P. Gomes, Ashish Sabharwal, Bart Selman: Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints. NIPS 2006: 481-488 |
| c65 | | Ashish Sabharwal, Carlos Ansótegui, Carla P. Gomes, Justin W. Hart, Bart Selman: QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency. SAT 2006: 382-395 |
| 2005 | ||
| j25 | | Ramón Béjar, Carmel Domshlak, Cèsar Fernández, Carla P. Gomes, Bhaskar Krishnamachari, Bart Selman, Magda Valls: Sensor networks and distributed CSP: communication, computation and complexity. Artif. Intell. 161(1-2): 117-147 (2005) |
| j24 | | Carla P. Gomes, Cèsar Fernández, Bart Selman, Christian Bessière: Statistical Regimes Across Constrainedness Regions. Constraints 10(4): 317-337 (2005) |
| j23 | | Yacine Boufkhad, Olivier Dubois, Yannet Interian, Bart Selman: Regular Random k-SAT: Properties of Balanced Formulas. J. Autom. Reasoning 35(1-3): 181-200 (2005) |
| c64 | | Ioannis A. Vetsikas, Bart Selman: Autonomous trading agent design in the presence of tradeoffs. ICEC 2005: 293-299 |
| c63 | | |
| c62 | | |
| 2004 | ||
| c61 | | Wei Wei, Jordan Erenrich, Bart Selman: Towards Efficient Sampling: Exploiting Random Walk Strategies. AAAI 2004: 670-676 |
| c60 | | Ioannis A. Vetsikas, Bart Selman: A Methodology and Equilibria for the Design Tradeoffs of Autonomous Trading Agents. AAMAS 2004: 1286-1287 |
| c59 | | Bart Selman: Algorithmic Adventures at the Interface of Computer Science, Statistical Physics, and Combinatorics. CP 2004: 9-12 |
| c58 | | Carla P. Gomes, Cèsar Fernández, Bart Selman, Christian Bessière: Statistical Regimes Across Constrainedness Regions. CP 2004: 32-46 |
| c57 | | |
| c56 | | Haixia Jia, Cristopher Moore, Bart Selman: From Spin Glasses to Hard Satisfiable Formulas. SAT (Selected Papers 2004: 199-210 |
| 2003 | ||
| c55 | | Ioannis A. Vetsikas, Bart Selman: A principled study of the design tradeoffs for autonomous trading agents. AAMAS 2003: 473-480 |
| c54 | | Henry A. Kautz, Bart Selman: Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search. CP 2003: 1-18 |
| c53 | | Ryan Williams, Carla P. Gomes, Bart Selman: Backdoors To Typical Case Complexity. IJCAI 2003: 1173-1178 |
| c52 | | Ramón Béjar, Carmel Domshlak, Cèsar Fernández, Carla P. Gomes, Bart Selman, Magda Valls: Grid-based SensorDCSP. IJCAI 2003: 1359-1361 |
| c51 | | Jordan Erenrich, Bart Selman: Sampling Combinatorial Spaces Using Biased Random Walks. IJCAI 2003: 1376-1380 |
| c50 | | John E. Hopcroft, Omar Khan, Brian Kulis, Bart Selman: Natural communities in large linked networks. KDD 2003: 541-546 |
| 2002 | ||
| c49 | | Henry A. Kautz, Eric Horvitz, Yongshao Ruan, Carla P. Gomes, Bart Selman: Dynamic Restart Policies. AAAI/IAAI 2002: 674-681 |
| c48 | | |
| 2001 | ||
| j22 | | |
| j21 | | Henry A. Kautz, Bart Selman: Preface: Volume 9. Electronic Notes in Discrete Mathematics 9: 1 (2001) |
| j20 | | Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla P. Gomes, Bart Selman, Mark E. Stickel: Balance and Filtering in Structured Satisfiable Problems (Preliminary Report). Electronic Notes in Discrete Mathematics 9: 2-18 (2001) |
| j19 | | Eric Horvitz, Yongshao Ruan, Carla P. Gomes, Henry A. Kautz, Bart Selman, David Maxwell Chickering: A Bayesian Approach to Tackling Hard Computational Problems (Preliminary Report). Electronic Notes in Discrete Mathematics 9: 376-391 (2001) |
| j18 | | Olivier Dubois, Rémi Monasson, Bart Selman, Riccardo Zecchina: Editorial. Theor. Comput. Sci. 265(1-2): 1 (2001) |
| c47 | | Hubie Chen, Carla P. Gomes, Bart Selman: Formal Models of Heavy-Tailed Behavior in Combinatorial Search. CP 2001: 408-421 |
| c46 | | Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla P. Gomes, Bart Selman, Mark E. Stickel: Balance and Filtering in Structured Satisfiable Problems. IJCAI 2001: 351-358 |
| c45 | | Eric Horvitz, Yongshao Ruan, Carla P. Gomes, Henry A. Kautz, Bart Selman, David Maxwell Chickering: A Bayesian Approach to Tackling Hard Computational Problems. UAI 2001: 235-244 |
| 2000 | ||
| j17 | | Derek Long, Henry A. Kautz, Bart Selman, Blai Bonet, Hector Geffner, Jana Koehler, Michael Brenner, Jörg Hoffmann, Frank Rittinger, Corin R. Anderson, Daniel S. Weld, David E. Smith, Maria Fox: The AIPS-98 Planning Competition. AI Magazine 21(2): 13-33 (2000) |
| j16 | | Bart Selman: Compute-intensive methods in artificial intelligence. Ann. Math. Artif. Intell. 28(1-4): 35-38 (2000) |
| j15 | | Carla P. Gomes, Bart Selman: Hybrid Search Strategies for Heterogeneous Search Spaces. International Journal on Artificial Intelligence Tools 9(1): 45-57 (2000) |
| j14 | | Carla P. Gomes, Bart Selman, Nuno Crato, Henry A. Kautz: Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems. J. Autom. Reasoning 24(1/2): 67-100 (2000) |
| c44 | | Dimitris Achlioptas, Carla P. Gomes, Henry A. Kautz, Bart Selman: Generating Satisfiable Problem Instances. AAAI/IAAI 2000: 256-261 |
| c43 | | Bhaskar Krishnamachari, Xi Xie, Bart Selman, Stephen B. Wicker: Analysis of Random Noise and Random Walk Algorithms. CP 2000: 278-290 |
| c42 | | Yi-Cheng Huang, Bart Selman, Henry A. Kautz: Learning Declarative Control Rules for Constraint-BAsed Planning. ICML 2000: 415-422 |
| c41 | | |
| e1 | | Anthony G. Cohn, Fausto Giunchiglia, Bart Selman (Eds.): KR 2000, Principles of Knowledge Representation and Reasoning Proceedings of the Seventh International Conference, Breckenridge, Colorado, USA, April 11-15, 2000. Morgan Kaufmann 2000 |
| 1999 | ||
| j13 | | Rémi Monasson, Riccardo Zecchina, Scott Kirkpatrick, Bart Selman, Lidror Troyansky: 2+p-SAT: Relation of typical-case complexity to the nature of the phase transition. Random Struct. Algorithms 15(3-4): 414-435 (1999) |
| c40 | | Yi-Cheng Huang, Bart Selman, Henry A. Kautz: Control Knowledge in Planning: Benefits and Tradeoffs. AAAI/IAAI 1999: 511-517 |
| c39 | | |
| c38 | | |
| c37 | | |
| 1998 | ||
| c36 | | Carla P. Gomes, Bart Selman, Henry A. Kautz: Boosting Combinatorial Search Through Randomization. AAAI/IAAI 1998: 431-437 |
| c35 | | Henry A. Kautz, Bart Selman: The Role of Domain-Specific Knowledge in the Planning as Satisfiability Framework. AIPS 1998: 181-189 |
| c34 | | Carla P. Gomes, Bart Selman, Ken McAloon, Carol Tretkoff: Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems. AIPS 1998: 208-213 |
| 1997 | ||
| j12 | | |
| j11 | | Henry A. Kautz, Bart Selman, Mehul A. Shah: Referral Web: Combining Social Networks and Collaborative Filtering. Commun. ACM 40(3): 63-65 (1997) |
| c33 | | Carla P. Gomes, Bart Selman: Problem Structure in the Presence of Perturbations. AAAI/IAAI 1997: 221-226 |
| c32 | | David A. McAllester, Bart Selman, Henry A. Kautz: Evidence for Invariants in Local Search. AAAI/IAAI 1997: 321-326 |
| c31 | | Carla P. Gomes, Bart Selman, Nuno Crato: Heavy-Tailed Distributions in Combinatorial Search. CP 1997: 121-135 |
| c30 | | Bart Selman, Henry A. Kautz, David A. McAllester: Ten Challenges in Propositional Reasoning and Search. IJCAI (1) 1997: 50-54 |
| c29 | | |
| 1996 | ||
| j10 | | Bart Selman, David G. Mitchell, Hector J. Levesque: Generating Hard Satisfiability Problems. Artif. Intell. 81(1-2): 17-29 (1996) |
| j9 | | Bart Selman, Scott Kirkpatrick: Critical Behavior in the Computational Cost of Satisfiability Testing. Artif. Intell. 81(1-2): 273-295 (1996) |
| j8 | | Bart Selman, Hector J. Levesque: Support Set Selection for Abductive and Default Reasoning. Artif. Intell. 82(1-2): 259-272 (1996) |
| j7 | | Bart Selman: Computational Challenges in Artificial Intelligence. ACM Comput. Surv. 28(4es): 10 (1996) |
| j6 | | Bart Selman, Henry A. Kautz: Knowledge Compilation and Theory Approximation. J. ACM 43(2): 193-224 (1996) |
| c28 | | Henry A. Kautz, Bart Selman, Al Milewski: Agent Amplified Communication. AAAI/IAAI, Vol. 1 1996: 3-9 |
| c27 | | Henry A. Kautz, Bart Selman: Pushing the Envelope: Planning, Propositional Logic and Stochastic Search. AAAI/IAAI, Vol. 2 1996: 1194-1201 |
| c26 | | Bart Selman, Rodney A. Brooks, Thomas L. Dean, Eric Horvitz, Tom M. Mitchell, Nils J. Nilsson: Challenge Problems for Artificial Intelligence (Panel Statements). AAAI/IAAI, Vol. 2 1996: 1340-1345 |
| c25 | | Henry A. Kautz, David A. McAllester, Bart Selman: Encoding Plans in Propositional Logic. KR 1996: 374-384 |
| 1995 | ||
| j5 | | Henry A. Kautz, Michael J. Kearns, Bart Selman: Horn Approximations of Empirical Data. Artif. Intell. 74(1): 129-145 (1995) |
| c24 | | Joann J. Ordille, Oswald Drobnik, Michael R. Genesereth, Y. Lashkari, Bart Selman: Intelligent Agents in Distributed Systems (Panel). ICDCS 1995: 342 |
| c23 | | Goran Gogic, Henry A. Kautz, Christos H. Papadimitriou, Bart Selman: The Comparative Linguistics of Knowledge Representation. IJCAI (1) 1995: 862-869 |
| c22 | | |
| c21 | | Eugene C. Freuder, Rina Dechter, Matthew L. Ginsberg, Bart Selman, Edward P. K. Tsang: Systematic Versus Stochastic Constraint Satisfaction. IJCAI 1995: 2027-2032 |
| 1994 | ||
| j4 | | Henry A. Kautz, Bart Selman, Michael H. Coen: Bottom-Up Design of Software Agents. Commun. ACM 37(7): 143-146 (1994) |
| c20 | | Henry A. Kautz, Bart Selman: An Empirical Evaluation of Knowledge Compilation by Theory Approximation. AAAI 1994: 155-161 |
| c19 | | Bart Selman, Henry A. Kautz, Bram Cohen: Noise Strategies for Improving Local Search. AAAI 1994: 337-343 |
| c18 | | Henry A. Kautz, Bart Selman, Michael H. Coen, Steven P. Ketchpel, Chris Ramming: An Experiment in the Design of Software Agents. AAAI 1994: 438-443 |
| c17 | | |
| c16 | | |
| 1993 | ||
| j3 | | Bart Selman, Hector J. Levesque: The Complexity of Path-Based Defeasible Inheritance. Artif. Intell. 62(2): 303-339 (1993) |
| c15 | | Henry A. Kautz, Michael J. Kearns, Bart Selman: Reasoning With Characteristic Models. AAAI 1993: 34-39 |
| c14 | | Bart Selman, Henry A. Kautz: An Empirical Study of Greedy Local Search for Satisfiability Testing. AAAI 1993: 46-51 |
| c13 | | |
| c12 | | Bart Selman, Henry A. Kautz: Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems. IJCAI 1993: 290-295 |
| 1992 | ||
| c11 | | Bart Selman, Hector J. Levesque, David G. Mitchell: A New Method for Solving Hard Satisfiability Problems. AAAI 1992: 440-446 |
| c10 | | David G. Mitchell, Bart Selman, Hector J. Levesque: Hard and Easy Distributions of SAT Problems. AAAI 1992: 459-465 |
| c9 | | |
| c8 | | Henry A. Kautz, Bart Selman: Forming Concepts for Fast Inference. ECAI Workshop on Knowledge Representation and Reasoning 1992: 200-215 |
| c7 | | |
| 1991 | ||
| j2 | | Henry A. Kautz, Bart Selman: Hard Problems for Simple Default Logics. Artif. Intell. 49(1-3): 243-279 (1991) |
| c6 | | |
| c5 | | |
| 1990 | ||
| j1 | | Bart Selman, Henry A. Kautz: Model-Preference Default Theories. Artif. Intell. 45(3): 287-322 (1990) |
| c4 | | Bart Selman, Hector J. Levesque: Abductive and Default Reasoning: A Computational Core. AAAI 1990: 343-348 |
| 1989 | ||
| c3 | | |
| c2 | | |
| 1988 | ||
| c1 | | |
Colors in the list of coauthors
Last update Sat May 25 03:11:35 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page