Sciweavers

271 search results - page 32 / 55
» A comparison between two logical formalisms for rewriting
Sort
View
KCAP
2005
ACM
14 years 1 months 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
2005
ACM
14 years 8 months ago
Permission accounting in separation logic
A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission be...
Richard Bornat, Cristiano Calcagno, Peter W. O'Hea...
FOIS
2008
13 years 9 months ago
Cognitive Context and Arguments from Ontologies for Learning
The deployment of learning resources on the web by different experts has resulted in the accessibility of multiple viewpoints about the same topics. In this work we assume that lea...
Christiana Panayiotou, Brandon Bennett
SEMWEB
2009
Springer
14 years 2 months ago
Computing Minimal Mappings
Given two classifications, or lightweight ontologies, we compute the minimal mapping, namely the subset of all possible correspondences, called mapping elements, between them such ...
Fausto Giunchiglia, Vincenzo Maltese, Aliaksandr A...
MA
2000
Springer
135views Communications» more  MA 2000»
13 years 11 months ago
Principles of Mobile Maude
Mobile Maude is a mobile agent language extending the rewriting logic language Maude and supporting mobile computation. Mobile Maude uses reflection to obtain a simple and general ...
Francisco Durán, Steven Eker, Patrick Linco...