Sciweavers

1143 search results - page 132 / 229
» Prospective Logic Agents
Sort
View
AAAI
2007
15 years 8 months ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
AAAI
1998
15 years 7 months ago
A Non-Deterministic Semantics for Tractable Inference
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
James M. Crawford, David W. Etherington
AAAI
2000
15 years 7 months ago
Solving Combinatorial Auctions Using Stochastic Local Search
Combinatorial auctions (CAs) have emerged as an important model in economics and show promise as a useful tool for tackling resource allocation in AI. Unfortunately, winner determ...
Holger H. Hoos, Craig Boutilier
AAAI
1996
15 years 7 months ago
Trajectory Constraints in Qualitative Simulation
We present a method for specifying temporal constraints on trajectories of dynamical systems and enforcing them during qualitative simulation. This capability can be used to focus...
Giorgio Brajnik, Daniel J. Clancy
AAAI
1994
15 years 7 months ago
Prediction Sharing Across Time and Contexts
Sometimes inferences made at some specific time are valid at other times, too. In model-based diagnosis and monitoring as well as qualitative simulation inferences are often re-do...
Oskar Dressler, Hartmut Freitag