| 7 |
|
A Logic for Causal Reasoning |
| 34 |
|
Belief, Awareness, and Two-Dimensional Logic |
| 35 |
|
SVMC: Single-Class Classification With Support Vector
Machines |
| 49 |
|
On the Undecidability of Description and Dynamic
Logics with Recursion and Counting |
| 60 |
|
Coherent Keyphrase Extraction via Web Mining |
| 61 |
|
Learning Minesweeper: A Testbed for General Purpose
Multirelational Learning |
| 75 |
|
The Power of Suggestion |
| 92 |
|
Minimal Change and Maximal Coherence for Epistemic
Logic Program Updates |
| 94 |
|
Understanding the Power of Clause Learning |
| 100 |
|
Evaluating Significance of Inconsistencies |
| 107 |
|
On the Equivalence between Answer Sets and Models
of Completion for Nested Logic Programs |
| 111 |
|
The Characterization of Strategy/False-name Proof
Combinatorial Auction Protocols: Price-oriented, Rationing-free Protocol
|
| 114 |
|
Ordering Default Theories |
| 118 |
|
Terminological cycles in a description logic with
existential restrictions |
| 119 |
|
Reasoning about Distances |
| 120 |
|
Least common subsumers and most specific concepts
in a description logic with existential restrictions and terminological
cycles |
| 121 |
|
A Maximal Tractable Class of Soft Constraints |
| 126 |
|
A New Look at the Semantics and Optimization Methods
of CP-Networks |
| 128 |
|
Increasing Dialogue Efficiency in Case-Based Reasoning
Without Loss of Solution Quality |
| 136 |
|
A General Model for Online Probabilistic Plan Recognition
|
| 142 |
|
Qualitative Decision under Uncertainty: Back to
Expected Utility |
| 146 |
|
Getting Serious about the Development of Computational
Humor |
| 163 |
|
Information Extraction from Web Documents Based
on Local Unranked Tree Automaton Inference |
| 168 |
|
Weak Conditional Logics of Normality |
| 169 |
|
Logic Programs for Consistently Querying Data Integration
Systems |
| 170 |
|
Describing Additive Fluents in Action Language C+
|
| 174 |
|
Contract Algorithms and Robots on Rays: Unifying
Two Scheduling Problems |
| 175 |
|
Skewing: An Efficient Alternative to Lookahead for
Decision Tree Induction |
| 178 |
|
Learning Value Predictors for the Speculative Execution
of Information Gathering Plans |
| 182 |
|
Body Movement Analysis of Human-Robot Interaction
|
| 192 |
|
Dynamics of Coalition Formation in Combinatorial
Trading |
| 198 |
|
A Dynamic Model for Occlusion Adaptive Joint Tracking
|
| 202 |
|
When Evolving Populations Is Better than Co-Evolving
Individuals: The Blind Mice Problem |
| 206 |
|
Recycling Computed Answers in Rewrite Systems for
Abduction |
| 214 |
|
Scenario-based Stochastic Constraint Programming
|
| 224 |
|
Detecting & Avoiding Interference Between Goals
in Intelligent Agents |
| 227 |
|
On Tight Logic Programs and Yet Another Translation
from Logic Programs to Propositional Logic |
| 229 |
|
In Defense of PDDL Axioms |
| 240 |
|
Resource Temporal Networks: Definition and Complexity
|
| 241 |
|
On the application of least-commitment and heuristic
search in temporal planning |
| 244 |
|
Decidability of SHIQ with Complex Role Inclusion
Axioms |
| 246 |
|
Keys, Nominals, and Concrete Domains |
| 254 |
|
The Concurrent, Continuous FLUX |
| 268 |
|
Multi-prototype Support Vector Machines |
| 271 |
|
Reasoning about soft constraints and conditional
preferences: complexity results and approximation techniques |
| 272 |
|
A Learning Algorithm for Web Page Scoring Systems
|
| 273 |
|
Multiset Ordering Constraints |
| 274 |
|
Layered Mereotopology |
| 286 |
|
Answer Set Optimization |
| 292 |
|
GHOST: experimenting conflicts countermeasures in
the pilot's activity |
| 295 |
|
Automatic Abstraction in Component-Based Diagnosis
Driven by System Observability |
| 310 |
|
A fast and simple algorithm for bounds consistency
of the alldifferent constraint |
| 318 |
|
On the Foundations of Expected Expected Utility
|
| 322 |
|
In the quest of the best form of local consistency
for weighted CSP |
| 330 |
|
Spaces of Theories with Ideal Refinement Operators
|
| 348 |
|
Incremental Utility Elicitation with the Minimax
Regret Decision Criterion |
| 349 |
|
A Bayesian Approach to Imitation in Reinforcement
Learning |
| 359 |
|
Tractable Pareto Optimization of Temporal Preferences
|
| 366 |
|
Integrating Multiple Internet Directories by Instance-based
Learning |
| 409 |
|
Optimal Time-Space Tradeoff in Probabilistic Inference
|
| 412 |
|
Evaluating Coverage for Large Symbolic NLG Grammars
|
| 421 |
|
Consistency and Set Intersection |
| 426 |
|
On the Revision of Probabilistic Beliefs using Uncertain
Evidence |
| 432 |
|
Algorithms for Identifying Rigid Subsystems in Geometric
Constraint Systems |
| 433 |
|
Incremental Tractable Reasoning about Qualitative
Temporal Constraints |
| 437 |
|
Causal Theories of Action: A Computational Core
|
| 445 |
|
From Logic Programming Semantics to the Consistency
of Syntactical Treatments of Knowledge & Belief |
| 446 |
|
Hidden Uncertainty in the Logical Representation
of Desires |
| 452 |
|
Does a New Simple Gaussian Weighting Approach Perform
Well in Text Categorization? |
| 463 |
|
Distributed Patient Scheduling in Hospitals |
| 466 |
|
A Learning-Based Jam Session System that Imitates
a Player's Personality Model |
| 468 |
|
Integrity and Change in Modular Ontologies |
| 478 |
|
Efficient Symmetry Breaking for Boolean Satisfiability
|
| 485 |
|
Non-Standard Reasoning Services for the Debugging
of Description Logic Terminologies |
| 491 |
|
Solving constraint optimization problems in anytime
contexts |
| 493 |
|
Amalgams of Constraint Satisfaction Problems |
| 498 |
|
Coupling CSP Decomposition Methods and Diagnosis
Algorithms for Tree-Structured Systems |
| 499 |
|
A Weighted Polynomial Information Gain Kernel for
resolving PP attachment Ambiguities with Support Vector Machines |
| 501 |
|
Formal Verification of Diagnosability via Symbolic
Model Checking |
| 504 |
|
Automatic Video Interpretation: A Novel Algorithm
for Temporal Scenario Recognition |
| 505 |
|
Non-Binary Constraints and Optimal Dual-Graph Representations
|
| 510 |
|
GRAEL: an agent-based evolutionary computing approach
for natural grammar development |
| 513 |
|
When Discriminative Learning of Bayesian Network
Parameters Is Easy |
| 514 |
|
Outlier Detection Using Default Logic |
| 515 |
|
Protocol Conformance for Logic Based Agents |
| 520 |
|
An Integrated Multilevel Learning Approach to Multiagent
Coalition Formation |
| 526 |
|
Qualitatively Faithful Quantitative Prediction |
| 529 |
|
Intelligent Multimedia Indexing and Retrieval through
Multi-source Information Extraction and Merging |
| 530 |
|
Complexity Results about Nash Equilibria |
| 532 |
|
AUC: a Statistically Consistent and more Discriminating
Measure than Accuracy |
| 534 |
|
Propagate the Right Thing: How Preferences Can Speed-Up
Constraint Solving |
| 546 |
|
Inductive Learning in Less Than One Sequential Scan
|
| 552 |
|
Minimally intrusive negotiating agents for resource
sharing |
| 553 |
|
Quantifying information and contradiction in propositional
logic through epistemic actions |
| 554 |
|
Query rewriting and answering under constraints
in data integration systems |
| 564 |
|
Constitutive Rules for Agent Communication Languages
|
| 567 |
|
A semantic framework to multimedia document adaptation
|
| 569 |
|
A Parametric Hierarchical Planner for Experimenting
Abstraction Techniques |
| 571 |
|
Hierarchical Semantic Classification: Word Sense
Disambiguation with World Knowledge |
| 573 |
|
Aggregate Functions in Disjunctive Logic Programming:
Semantics,Complexity,and Implementation in DLV |
| 574 |
|
Generalizing GraphPlan by Formulating Planning as
a CSP |
| 575 |
|
Tractable Symmetry Breaking for CSPs with Interchangeable
Values |
| 582 |
|
On a generalization of triangulated graphs for domains
decomposition of CSPs |
| 583 |
|
Responsibility and Blame: A Structural-Model Approach
|
| 589 |
|
Categorizing classes of signals by means of fuzzy
gradual rules |
| 592 |
|
Great Expectations. Part I: On the Customizability
of Generalized Expected Utility |
| 596 |
|
Great Expectations. Part II: Generalized Expected
Utility as a Universal Decision Rule |
| 610 |
|
On the Design of Social Diagnosis Algorithms for
Multi-Agent Teams |
| 620 |
|
Tucking RCC in Cyc's Ontological Bed |
| 632 |
|
First-order probabilistic inference |
| 633 |
|
A Theory of Average-Case Compilability in Knowledge
Representation |
| 634 |
|
Inverse Circumscription |
| 644 |
|
Phase Transitions of Bounded Satisfiability Problems
|
| 649 |
|
On Identifying and Managing Relationships in Multi-Agent
Systems |
| 651 |
|
Abductive Matchmaking using Description Logics |
| 654 |
|
Web Page Cleaning for Web Mining through Feature
Weighting |
| 657 |
|
Learning to Classify Texts Using Positive and Unlabeled
Data |
| 668 |
|
Complexity of Determining Nonemptiness of the Core
|
| 671 |
|
Action representation and partially observable planning
using epistemic logic |
| 674 |
|
Compilation and Biologically Inspired Self-Assembly
of Two-Dimensional Shapes |
| 676 |
|
Probabilistically Survivable MASs |
| 679 |
|
An Extension of the ICP Algorithm for Modeling Nonrigid
Objects with Mobile Robots |
| 682 |
|
A Tractability Result for Reasoning with Incomplete
First-Order Knowledge Bases |
| 684 |
|
A Structure-Based Variable Ordering Heuristic for
SAT |
| 685 |
|
Dynamic Bayesian modeling of the cerebral activity
|
| 697 |
|
Emergence of Cooperation in a Pursuit-Evasion Game
|
| 698 |
|
Backdoors To Typical Case Complexity |
| 702 |
|
ODISET: On-line Distributed Session Tracing using
Agents |
| 705 |
|
Thin Junction Tree Filters for Simultaneous Localization
and Mapping |
| 722 |
|
Last-Branch and Speculative Pruning Algorithms for
Maxn |
| 729 |
|
Comparing Agents & Humans Using Behavior Bounding
|
| 731 |
|
Semi-Supervised Learning with an Explicit Label-Error
Model for Misclassified Data |
| 734 |
|
Constructing Diverse Classifier Ensembles using
Artificial Training Examples |
| 735 |
|
Point-based value iteration: An anytime algorithm
for POMDPs |
| 745 |
|
Monte Carlo Theory as an Explanation of Bagging
and Boosting |
| 746 |
|
What is Artificial Intelligence? Psychometric AI
as an Answer |
| 761 |
|
Definition and Complexity of Some Basic Metareasoning
Problems |
| 765 |
|
Evaluating Classifiers by Means of Test Data with
Noisy Labels |
| 771 |
|
Factored Planning |
| 774 |
|
Automated Qualitative Domain Abstraction |
| 775 |
|
Where is...? Learning and Exploiting Motion Patterns
of Persons with Mobile Robots |
| 776 |
|
Efficient Information Gain-based Exploration of
Unknown Terrain |
| 782 |
|
Backbone Guided Local Search for Maximum Satisfiability
|
| 786 |
|
Phase Transitions of the Asymmetric Traveling Salesman
|
| 787 |
|
An Improved Algorithm for Optimal Bin Packing |
| 793 |
|
A Language to Describe Drawing, Display, and Editing
in Sketch Recognition |
| 795 |
|
An Ontology-based Architecture for Cooperative Information
Agents |
| 802 |
|
Improving Coevolutionary Search for Optimal Multiagent
Behaviors |
| 804 |
|
Automated Generation of Graphic Sketches by Example
|
| 808 |
|
Maximizing Flexibility: A Retraction Heuristic for
Oversubscribed Scheduling Problems |
| 815 |
|
Qualitative Map Learning Based on Co-visibility
of Objects |
| 825 |
|
Gaussian Process Models of Spatial Aggregation Algorithms
|
| 830 |
|
Active learning with strong and weak views: a case
study on wrapper induction |
| 831 |
|
Consistent, Convergent, and Constant-Time SLAM |
| 833 |
|
DP-SLAM: Fast, Robust Simultaneous Localization
and Mapping Without Predetermined Landmarks |
| 840 |
|
Compiling Control Knowledge into Preconditions for
Planning in the Situation Calculus |
| 843 |
|
Causes and Explanations Revisited |
| 844 |
|
Data Clustering: Principal Components, Hopfield
and Self-Aggregation Networks |
| 847 |
|
Hierarchical Hidden Markov Models for Information
Extraction |
| 850 |
|
Comparing Best-First Search and Dynamic Programming
for Optimal Multiple Sequence Alignment |
| 854 |
|
Nonlinear dimensionality reduction by kernel eigenmaps
|
| 858 |
|
Approximating Optimal Policies for Agents with Limited
Execution Resources |
| 859 |
|
Universal Voting Protocol Tweaks to Make Manipulation
Hard |
| 871 |
|
Bayesian Information Extraction Network |
| 872 |
|
Covariant Policy Search |
| 881 |
|
Distributed Clustering Based on Sampling Local Density
Estimates |
| 883 |
|
Dynamic Probabilistic Relational Models |
| 888 |
|
Sparse-Memory Graph Search |
| 899 |
|
Approximating Game-Theoretic Optimal Strategies
for Full-scale Poker |
| 906 |
|
Practical Partition-Based Theorem Proving for Large
Knowledge Bases |
| 907 |
|
FastSLAM 2.0: An Improved Particle Filtering Algorithm
for Simultaneous Localization and Mapping that Provably Converges
|
| 913 |
|
Logical Filtering |
| 915 |
|
Reasoning about Knowledge, Time and Concurrency
in the Situation Calculus |
| 917 |
|
Model-based Diagnosis of Hybrid Systems |
| 920 |
|
Use of Off-line Dynamic Programming in Efficient
Image Interpretation |
| 924 |
|
Extended Gloss Overlaps as a Measure of Semantic
Relatedness |
| 925 |
|
SMDP Homomorphisms: An Algebraic Approach to Abstraction
in Semi-Markov Decision Processes |
| 926 |
|
Generalizing Plans to New Environments in Relational
MDPs |
| 930 |
|
A Continuation Method for Nash Equilibria in Graphical
Games |
| 931 |
|
Simultaneous Adversarial Multi-Robot Learning |
| 932 |
|
Factored A* Search for Models over Sequences and
Trees |
| 934 |
|
Corpus-based, Statistical Goal Recognition |
| 939 |
|
Spectral Learning |
| 943 |
|
Taming Decentralized POMDPs: Towards Efficient Policy
Computation for Multiagent Settings |
| 944 |
|
People Tracking with Anonymous and ID-Sensors |
| 949 |
|
Faster Heuristic Search Algorithms for Planning
with Uncertainty and Full Feedback |
| 952 |
|
Variable Resolution Particle Filter |
| 955 |
|
Local Effect Games |
| 960 |
|
Non-Invasive Brain-Actuated Control of a Mobile
Robot |