Sciweavers

1021 search results - page 48 / 205
» Concepts in Proof Planning
Sort
View
FUIN
2006
139views more  FUIN 2006»
13 years 8 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
CADE
2006
Springer
14 years 9 months ago
Importing HOL into Isabelle/HOL
We developed an importer from both HOL 4 and HOL-light into Isabelle/HOL. The importer works by replaying proofs within Isabelle/HOL that have been recorded in HOL 4 or HOL-light a...
Steven Obua, Sebastian Skalberg
JELIA
2004
Springer
14 years 2 months ago
Explaining Subsumption by Optimal Interpolation
We describe ongoing research to support the construction of terminologies with Description Logics. For the explanation of subsumption we search for particular concepts because of t...
Stefan Schlobach
COR
2010
101views more  COR 2010»
13 years 8 months ago
Constraint-specific recovery network for solving airline recovery problems
In this paper, we consider the recovery of an airline schedule after an unforeseen event called disruption, making the planned schedule infeasible. We present a modeling framework...
Niklaus Eggenberg, Matteo Salani, Michel Bierlaire
AMAI
2004
Springer
13 years 8 months ago
Representing von Neumann-Morgenstern Games in the Situation Calculus
Sequential von Neumann-Morgernstern (VM) games are a very general formalism for representing multi-agent interactions and planning problems in a variety of types of environments. ...
Oliver Schulte, James P. Delgrande