Sciweavers

3658 search results - page 408 / 732
» The logic of proofs, semantically
Sort
View
DLOG
1998
15 years 8 months ago
Comparing Subsumption Optimizations
Effective systems for expressive description logics require a heavily-optimised subsumption checker incorporating a range of optimisation techniques. Because of the correspondence...
Ian Horrocks, Peter F. Patel-Schneider
LPAR
2004
Springer
16 years 4 days ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel
ICLP
2005
Springer
16 years 9 days ago
Modeling Systems in CLP
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
208
Voted
KCAP
2005
ACM
16 years 10 days ago
Matching utterances to rich knowledge structures to acquire a model of the speaker's goal
An ultimate goal of AI is to build end-to-end systems that interpret natural language, reason over the resulting logical forms, and perform actions based on that reasoning. This r...
Peter Z. Yeh, Bruce W. Porter, Ken Barker
POPL
2007
ACM
16 years 7 months ago
Towards a mechanized metatheory of standard ML
We present an internal language with equivalent expressive power to Standard ML, and discuss its formalization in LF and the machine-checked verification of its type safety in Twe...
Daniel K. Lee, Karl Crary, Robert Harper