102 search results - page 9 / 21 » Reformulation for Extensional Reasoning |
LOGCOM
2008
13 years 7 months ago
2008
Question Answering (QA) is a task that deserves more collaboration between Natural Language Processing (NLP) and Knowledge Representation (KR) communities, not only to introduce r...
ICLP
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. The Event Calculus is a narrative based formalism for reasoning about actions and change originally proposed in logic programming form by Kowalski and Sergot. In this pap...
TPHOL
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
ASP
2001
Springer
14 years 3 days ago
2001
Springer
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
DLOG
2007
13 years 10 months ago
2007
Enabling the Semantic Web requires solving the semantic heterogeneity problem, for which ontology matching methods have been proposed. These methods rely on similarity measures tha...