Sciweavers

138 search results - page 14 / 28
» An Unsupervised Approach for Semantic Relation Interpretatio...
Sort
View
AGP
1994
IEEE
15 years 3 months ago
A Compositional Semantics for Conditional Term Rewriting Systems
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
María Alpuente, Moreno Falaschi, Marí...
JAIR
2007
121views more  JAIR 2007»
14 years 11 months ago
On the Semantics of Logic Programs with Preferences
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation fo...
Sergio Greco, Irina Trubitsyna, Ester Zumpano
POPL
2004
ACM
16 years 3 hour ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
COLING
2008
15 years 1 months ago
Modeling Semantic Containment and Exclusion in Natural Language Inference
We propose an approach to natural language inference based on a model of natural logic, which identifies valid inferences by their lexical and syntactic features, without full sem...
Bill MacCartney, Christopher D. Manning
ESWS
2008
Springer
15 years 1 months ago
Mapping Validation by Probabilistic Reasoning
In the semantic web environment, where several independent ontologies are used in order to describe knowledge and data, ontologies have to be aligned by defining mappings among the...
Silvana Castano, Alfio Ferrara, Davide Lorusso, To...