default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th IJCAI 2005: Edinburgh, Scotland, UK
- Leslie Pack Kaelbling, Alessandro Saffiotti:
IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30 - August 5, 2005. Professional Book Center 2005, ISBN 0938075934
Case-Based Reasoning
- Eyke Hüllermeier:
Cho-k-NN: A Method for Combining Interacting Pieces of Evidence in Case-Based Learning. 3-8 - David McSherry, Christopher Stretch:
Automating the Discovery of Recommendation Knowledge. 9-14 - David W. Patterson, Niall Rooney, Vladimir Dobrynin, Mykola Galushka:
Sophia: A novel approach for Textual Case-based Reasoning. 15-20 - Timo Steffens:
Partial, Vague Knowledge for Similarity Measures. 21-26 - Hui Wang, Werner Dubitzky:
A flexible and robust similarity measure based on contextual probability. 27-34
Constraint Satisfaction and Search
- Fahiem Bacchus, Toby Walsh:
Propagating Logical Combinations of Constraints. 35-40 - Joachim Peter Bekmann, Achim G. Hoffmann:
Improved Knowledge Acquisition for High-Performance Heuristic Search. 41-46 - Marco Benedetti:
Extracting Certificates from Quantified Boolean Formulas. 47-53 - Christian Bessiere, Romuald Debruyne:
Optimal and Suboptimal Singleton Arc Consistency Algorithms. 54-59 - Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh:
The Range and Roots Constraints: Specifying Counting and Occurrence Problems. 60-65 - Hubie Chen, Yannet Interian:
A Model for Generating Random Quantified Boolean Formulas. 66-71 - David A. Cohen, Peter Jeavons, Marc Gyssens:
A Unified Theory of Structural Tractability for Constraint Satisfaction and Spread Cut Decomposition. 72-77 - Joseph C. Culberson, Yong Gao, Calin Anton:
Phase Transitions of Dominating Clique Problem and Their Implications to Heuristics in Satisfiability Search. 78-83 - Simon de Givry, Federico Heras, Matthias Zytnicki, Javier Larrosa:
Existential arc consistency: Getting closer to full arc consistency in weighted CSPs. 84-89 - Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits:
A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming. 90-96 - Thomas Eiter, Hans Tompits, Stefan Woltran:
On Solution Correspondences in Answer-Set Programming. 97-102 - Ariel Felner, Uzi Zahavi, Jonathan Schaeffer, Robert C. Holte:
Dual Lookups in Pattern Databases. 103-108 - Alan M. Frisch, Christopher Jefferson, Bernadette Martínez Hernández, Ian Miguel:
The Rules of Constraint Modelling. 109-116 - Alex S. Fukunaga, Richard E. Korf:
Bin-Completion Algorithms for Multicontainer Packing and Covering Problems. 117-124 - David Furcy, Sven Koenig:
Limited Discrepancy Beam Search. 125-131 - Timothy Furtak, Masashi Kiyomi
, Takeaki Uno, Michael Buro:
Generalized Amazons is PSPACE-Complete. 132-137 - Ian P. Gent, Peter Nightingale, Kostas Stergiou:
QCSP-Solve: A Solver for Quantified Constraint Satisfaction Problems. 138-143 - Judy Goldsmith, Jérôme Lang, Miroslaw Truszczynski, Nic Wilson:
The computational complexity of dominance and consistency in CP-nets. 144-149 - Georg Gottlob, Gianluigi Greco, Francesco Scarcello:
The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions. 150-155 - Jinbo Huang, Adnan Darwiche:
DPLL with a Trace: From SAT to Knowledge Compilation. 156-162 - Tudor Hulubei, Barry O'Sullivan:
Optimal Refutations for Constraint Satisfaction Problems. 163-168 - Frank Hutter, Holger H. Hoos, Thomas Stützle:
Efficient Stochastic Local Search for MPE Solving. 169-174 - Philip Kilby, John K. Slaney, Toby Walsh:
The Backbone of the Travelling Salesperson. 175-180 - Philippe Laborie:
Complete MCS-Based Search: Application to Resource Constrained Project Scheduling. 181-186 - Frédéric Lardeux, Frédéric Saubion, Jin-Kao Hao:
Three Truth Values for the SAT and MAX-SAT Problems. 187-192 - Javier Larrosa, Federico Heras:
Resolution in Max-SAT and its relation to local consistency in weighted CSPs. 193-198 - Christophe Lecoutre, Stéphane Cardon:
A Greedy Approach to Establish Singleton Arc Consistency. 199-204 - Mark H. Liffiton, Michael D. Moffitt, Martha E. Pollack, Karem A. Sakallah:
Identifying Conflicts in Overconstrained Temporal Problems. 205-211 - Mitja Lustrek, Matjaz Gams, Ivan Bratko:
Why Minimax Works: An Alternative Explanation. 212-217 - Lawrence Mandow, José-Luis Pérez-de-la-Cruz:
A New Approach to Multiobjective A* Search. 218-223 - Radu Marinescu, Rina Dechter:
AND/OR Branch-and-Bound for Graphical Models. 224-229 - Robert Mateescu, Rina Dechter:
AND/OR Cutset Conditioning. 230-235 - Deepak Mehta, Marc R. C. van Dongen:
Reducing Checks and Revisions in Coarse-grained MAC Algorithms. 236-241 - Michael D. Moffitt, Martha E. Pollack:
Applying Local Search to Disjunctive Temporal Problems. 242-247 - Pascal Nicolas, Laurent Garcia, Igor Stéphan:
Possibilistic Stable Models. 248-253 - Austin Parker, Dana S. Nau, V. S. Subrahmanian:
Game-Tree Search with Combinatorially Large Belief States. 254-259 - Gilles Pesant:
Counting Solutions of CSPs: A Structural Approach. 260-265 - Adrian Petcu, Boi Faltings:
A Scalable Method for Multiagent Constraint Optimization. 266-271 - Jean-Francois Puget:
Breaking symmetries in all different problems. 272-277 - Stuart Russell, Jason Andrew Wolfe:
Efficient belief-state AND-OR search, with application to Kriegspiel. 278-285 - Martin Sachenbacher, Brian C. Williams:
Bounded Search and Symbolic Inference for Constraint Optimization. 286-291 - Jonathan Schaeffer, Yngvi Björnsson, Neil Burch, Akihiro Kishimoto, Martin Müller, Robert Lake, Paul Lu, Steve Sutphen:
Solving Checkers. 292-297 - Meinolf Sellmann, Pascal Van Hentenryck:
Structural Symmetry Breaking. 298-303 - Özgür Simsek, David D. Jensen:
Decentralized Search in Networks Using Homophily and Degree Disparity. 304-310 - Barbara M. Smith, Paula Sturdy:
Value Ordering for Finding All Solutions. 311-316 - Nathan R. Sturtevant:
Leaf-Value Tables for Pruning Non-Zero-Sum Games. 317-323 - Shavit Talman, Rotem Toister, Sarit Kraus:
Choosing between heuristics and strategies: an enhanced model for decision-making. 324-330 - Nic Wilson:
Decision Diagrams for the Computation of Semiring Valuations. 331-336 - Ke Xu, Frédéric Boussemart, Fred Hemery, Christophe Lecoutre:
A Simple Model to Generate Hard Satisfiable Instances. 337-342 - Weixiong Zhang, Moshe Looks:
A Novel Local Search Algorithm for the Traveling Salesman Problem that Exploits Backbones. 343-350
Knowledge Representation and Reasoning
- Philippe Adjiman, Philippe Chatalic, François Goasdoué, Marie-Christine Rousset, Laurent Simon:
Scalability Study of Peer-to-Peer Consequence Finding. 351-356 - Chen Avin, Ilya Shpitser, Judea Pearl:
Identifiability of Path-Specific Effects. 357-363 - Franz Baader, Sebastian Brandt, Carsten Lutz:
Pushing the EL Envelope. 364-369 - Grégory Batt, Delphine Ropers, Hidde de Jong, Johannes Geiselmann, Radu Mateescu, Michel Page, Dominique Schneider:
Analysis and Verification of Qualitative Models of Genetic Regulatory Networks: A Model-Checking Approach. 370-375 - Salem Benferhat, Sylvain Lagrue, Odile Papini:
Revision of Partially Ordered Information: Axiomatization, Semantics and Iteration. 376-381 - Thomas Bittner, Maureen Donnelly:
Computational ontologies of parthood, componenthood, and containment. 382-387 - Alexander Bochman:
Propositional Argumentation and Causal Reasoning. 388-393 - Richard Booth, Alexander Nittka:
Reconstructing an Agent's Epistemic State from Observations. 394-399 - Martin Brooks, Yuhong Yan, Daniel Lemire:
Scale-Based Monotonicity Analysis in Qualitative Modelling with Flat Segments. 400-405 - Francesco Calimeri, Wolfgang Faber, Nicola Leone, Simona Perri:
Declarative and Computational Properties of Logic Programs with Aggregates. 406-411 - Hubie Chen:
Parameterized Compilability. 412-417 - Thomas Eiter, Esra Erdem, Michael Fink, Ján Senko:
Updating Action Domain Descriptions. 418-423 - Patricia Everaere, Sébastien Konieczny, Pierre Marquis:
Quota and Gmin Merging Operators. 424-429 - Wolfgang Faber, Kathrin Konczak:
Strong Equivalence for Logic Programs with Preferences. 430-435 - Alberto Finzi, Fiora Pirri:
Representing Flexible Temporal Behaviors in the Situation Calculus. 436-441 - Andreas Herzig, Ivan Varzinczak:
Cohesion, coupling and the meta-theory of actions. 442-447 - Ian Horrocks, Ulrike Sattler:
A Tableaux Decision Procedure for SHOIQ. 448-453 - Zhisheng Huang, Frank van Harmelen, Annette ten Teije:
Reasoning with Inconsistent Ontologies. 454-459 - Aaron Hunter, James P. Delgrande:
Iterated Belief Change: A Transition System Approach. 460-465 - Ullrich Hustadt, Boris Motik, Ulrike Sattler:
Data Complexity of Reasoning in Very Expressive Description Logics. 466-471 - Katsumi Inoue, Chiaki Sakama:
Equivalence in Abductive Logic. 472-477 - Yi Jin, Michael Thielscher:
Iterated Belief Revision, Revised. 478-483 - Sébastien Konieczny, Jérôme Lang, Pierre Marquis:
Reasoning under inconsistency: the forgotten connective. 484-489 - Gerhard Lakemeyer, Hector J. Levesque:
Semantics for a useful fragment of the situation calculus. 490-496 - Noël Laverny, Jérôme Lang:
From knowledge-based programs to graded belief-based programs, part II: off-line reasoning. 497-502 - Joohyung Lee:
A Model-Theoretic Counterpart of Loop Formulas. 503-508 - Hector J. Levesque:
Planning with Loops. 509-515 - Fangzhen Lin, Yin Chen:
Discovering Classes of Strongly Equivalent Logic Programs. 516-521 - Yongmei Liu, Hector J. Levesque:
Tractable Reasoning with Incomplete First-Order Knowledge in Dynamic Systems with Context-Dependent Actions. 522-527 - Laura S. Mastella, Mara Abel, Luís C. Lamb, Luis Fernando De Ros:
Cognitive Modelling of Event Ordering Reasoning in Imagistic Domains. 528-533 - Gustav Nordh, Bruno Zanuttini:
Propositional Abduction is Almost Always Hard. 534-539 - Maurice Pagnucco, David Rajaratnam:
Inverse Resolution as Belief Change. 540-545 - Peter F. Patel-Schneider:
Building the Semantic Web Tower from RDF Straw. 546-551 - Guilin Qi, Weiru Liu, David A. Bell:
Measuring conflict and agreement between two prioritized belief bases. 552-557 - Floris Roelofsen, Luciano Serafini:
Minimal and Absent Information in Contexts. 558-563 - Paulo E. Santos, Brandon Bennett, Georgios Sakellariou:
Supervaluation Semantics for an Inland Water Feature Ontology. 564-569 - Luciano Serafini, Alexander Borgida, Andrei Tamilin:
Aspects of Distributed and Modular Ontology Reasoning. 570-575 - Luciano Serafini, Heiner Stuckenschmidt, Holger Wache:
A Formal Investigation of Mapping Language for Terminological Knowledge. 576-581 - Steven Shapiro, Yves Lespérance, Hector J. Levesque:
Goal Change. 582-588 - Afsaneh Shirazi, Eyal Amir:
First-Order Logical Filtering. 589-595 - Dorian Suc, Ivan Bratko:
Combining Learning Constraints and Numerical Regression. 596-602 - David Toman, Grant E. Weddell:
On the Interaction between Inverse Features and Path-functional Dependencies in Description Logics. 603-608 - Dmitry Tsarkov, Ian Horrocks:
Ordering Heuristics for Description Logic Reasoning. 609-614 - Fusun Yaman, Dana S. Nau, V. S. Subrahmanian:
Going Far, Logically. 615-620 - Fusun Yaman, Dana S. Nau, V. S. Subrahmanian:
A Motion Closed World Asumption. 621-626 - Yan Zhang, Norman Y. Foo, Kewen Wang:
Solving Logic Program Conflict through Strong and Weak Forgettings. 627-634
Learning
- Isabelle Alvarez, Stephan Bernard:
Ranking Cases with Decision Trees: a Geometric Method that Preserves Intelligibility. 635-640 - Nicos Angelopoulos, James Cussens:
Exploiting Informative Priors for Bayesian Classification and Regression Trees. 641-646 - Martin Atzmüller, Frank Puppe, Hans-Peter Buscher:
Exploiting Background Knowledge for Knowledge-Intensive Subgroup Discovery. 647-652 - Dorit Avrahami-Zilberbrand, Gal A. Kaminka:
Fast and Complete Symbolic Plan Recognition. 653-658 - Massimiliano Ciaramita, Aldo Gangemi, Esther Ratsch, Jasmin Saric, Isabel Rojas:
Unsupervised Learning of Semantic Relations between Concepts of a Molecular Biology Ontology. 659-664 - Shay B. Cohen, Eytan Ruppin, Gideon Dror:
Feature Selection Based on the Shapley Value. 665-670 - William W. Cohen, Vitor Rocha de Carvalho:
Stacked Sequential Learning. 671-676 - Jesse Davis, Elizabeth S. Burnside, Inês de Castro Dutra, David Page, Raghu Ramakrishnan, Vítor Santos Costa, Jude W. Shavlik:
View Learning for Statistical Relational Learning: With an Application to Mammography. 677-683 - Michelangelo Diligenti, Marco Gori, Marco Maggini:
Learning Web Page Scores by Error Back-Propagation. 684-689 - Eyal Even-Dar, Sham M. Kakade, Yishay Mansour:
Reinforcement Learning in POMDPs Without Resets. 690-695 - Alan Fern:
A Simple-Transition Model for Relational Sequences. 696-701 - Peter A. Flach, Shaomin Wu:
Repairing Concavities in ROC Curves. 702-707 - Aram Galstyan, Paul R. Cohen:
Inferring Useful Heuristics from the Dynamics of Iterative Relational Classifiers. 708-713 - Yuhong Guo, Russell Greiner, Dale Schuurmans:
Learning Coordination Classifiers. 714-721 - Vu Ha, Tariq Samad:
Generalization Bounds for Weighted Binary Classification with Applications to Statistical Verification. 722-727 - Yaniv Hamo, Shaul Markovitch:
The COMPSET Algorithm for Subset Selection. 728-733 - Michael R. James, Britton Wolfe, Satinder Singh:
Combining Memory and Landmarks with Predictive State Representations. 734-739 - Rong Jin, Huan Liu:
Learning with Labeled Sessions. 740-745 - Rong Jin, Huan Liu:
A Novel Approach to Model Generation for Heterogeneous Data Classification. 746-751 - Nicholas K. Jong, Peter Stone:
State Abstraction Discovery from Irrelevant State Variables. 752-757 - Emir Kapanci, Avi Pfeffer:
Signal-to-Score Music Transcription using Graphical Models. 758-765 - Jonathan Lester, Tanzeem Choudhury, Nicky Kern, Gaetano Borriello, Blake Hannaford:
A Hybrid Discriminative/Generative Approach for Modeling Human Activities. 766-772 - Lin Liao, Dieter Fox, Henry A. Kautz:
Location-Based Activity Recognition using Relational Markov Networks. 773-778 - Bhaskara Marthi, Stuart Russell, David Latham, Carlos Guestrin:
Concurrent Hierarchical Reinforcement Learning. 779-785 - Andrew McCallum, Andrés Corrada-Emmanuel, Xuerui Wang:
Topic and Role Discovery in Social Networks. 786-791 - Kenneth McGarry, Stefan Wermter:
Training without data: Knowledge Insertion into RBF Neural Networks. 792-797 - Philippos Mordohai, Gérard G. Medioni:
Unsupervised Dimensionality Estimation and Manifold Learning in high-dimensional Spaces by Tensor Voting. 798-803 - Shinichi Nakajima, Sumio Watanabe:
Generalization Error of Linear Neural Networks in an Empirical Bayes Approach. 804-810 - Nicolas Pernot, Antoine Cornuéjols, Michèle Sebag:
Phase Transitions within Grammatical Inference. 811-816 - Rob Powers, Yoav Shoham:
Learning against opponents with bounded memory. 817-822 - Ronaldo C. Prati, Peter A. Flach:
ROCCER: An Algorithm for Rule Learning Based on ROC Analysis. 823-828 - Xipeng Qiu, Lide Wu:
Stepwise Nearest Neighbor Discriminant Analysis. 829-834 - Eddie J. Rafols, Mark B. Ring, Richard S. Sutton, Brian Tanner:
Using Predictive Representations to Improve Generalization in Reinforcement Learning. 835-840