Sciweavers

1941 search results - page 113 / 389
» Reasoning about Computations Using Two-Levels of Logic
Sort
View
DLOG
2001
15 years 4 months ago
Using Lazy Unfolding for the Computation of Least Common Subsumers
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...
Anni-Yasmin Turhan, Ralf Molitor
SAS
1991
Springer
102views Formal Methods» more  SAS 1991»
15 years 6 months ago
Equational Logics
d Abstract) Marcelo Fiore1 Chung-Kil Hur2,3 Computer Laboratory University of Cambridge Cambridge, UK We introduce an abstract general notion of system of equations between terms,...
Yong Sun
ENC
2005
IEEE
15 years 9 months ago
SKIMA: Semantic Knowledge and Information Management
This paper describes SKIMA, a mediation system that gives transparent access to heterogeneous and distributed sources considering their semantics and the semantics of application ...
Héctor Pérez-Urbina, Gennaro Bruno, ...
CL
2000
Springer
15 years 7 months ago
Representing Trees with Constraints
This paper presents a method for representing trees using constraint logic programming over finite domains. We describe a class of trees that is of particular interest to us and h...
Ben Curry, Geraint A. Wiggins, Gillian Hayes
119
Voted
JAIR
2010
131views more  JAIR 2010»
15 years 1 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