Sciweavers

3446 search results - page 245 / 690
» A Reasoning Algorithm for pD*
Sort
View
TPHOL
2005
IEEE
15 years 11 months ago
A HOL Theory of Euclidean Space
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
John Harrison
TABLEAUX
2000
Springer
15 years 9 months ago
Benchmark Analysis with FaCT
FaCT (Fast Classification of Terminologies) is a Description Logic (DL) classifier that can also be used for modal logic satisfiability testing. The FaCT system includes two reason...
Ian Horrocks
DLOG
2000
15 years 6 months ago
Adapting Optimization Techniques to Description Logics with Concrete Domains
In this paper, we demonstrate that the main standard optimization techniques dependency directed backtracking and model merging can be adapted to description logics with concrete ...
Anni-Yasmin Turhan, Volker Haarslev
JAR
1998
134views more  JAR 1998»
15 years 5 months ago
Integrating Computer Algebra into Proof Planning
Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two differ...
Manfred Kerber, Michael Kohlhase, Volker Sorge
JAIR
2010
131views more  JAIR 2010»
15 years 4 months ago
Narrative Planning: Balancing Plot and Character
Narrative, and in particular storytelling, is an important part of the human experience. Consequently, computational systems that can reason about narrative can be more effective...
Mark O. Riedl, R. Michael Young