102 search results - page 5 / 21 » Semantically Restricted Argument Dependencies |
CADE
2007
Springer
14 years 7 months ago
2007
Springer
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...
EPIA
1995
Springer
13 years 11 months ago
1995
Springer
In this paper, we study the retrieval problem in ALN, which is a tractable concept language with number restrictions. Following the approach proposed in [12], this work differs fr...
CAV
1999
Springer
13 years 11 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
ARGMAS
2009
Springer
14 years 2 months ago
2009
Springer
Resolving the semantic heterogeneity problem is crucial to allow interoperability between ontology-based systems. Ontology matching based on argumentation is an innovative research...
AMSTERDAM
2009
13 years 5 months ago
2009
Potts (2005, 2007) claims that Grice's `conventional implicatures' offer a powerful argument in favor of a multidimensional semantics, one in which certain expressions fa...