1737 search results - page 40 / 348 » On Interpolation in Existence Logics |
174
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
The aim of this paper is to show how we can handle the Recognising Textual Entailment (RTE) task by using Description Logics (DLs). To do this, we propose a representation of natur...
168
click to vote
JSYML
2008
15 years 6 months ago
2008
In this paper a method for the replacement, in formulas, of strong quantifiers by functions is introduced that can be considered as an alternative to Skolemization in the setting ...
203
Voted
AAAI
2011
14 years 6 months ago
2011
Plan recognition is a form of abductive reasoning that involves inferring plans that best explain sets of observed actions. Most existing approaches to plan recognition and other ...
188
click to vote
DATE
2004
IEEE
15 years 9 months ago
2004
IEEE
We propose an algorithm for efficient threshold network synthesis of arbitrary multi-output Boolean functions. The main purpose of this work is to bridge the wide gap that currentl...
149
click to vote
APAL
2006
15 years 6 months ago
2006
The existence of a final coalgebra is equivalent to the existence of a formal logic with a set (small class) of formulas that has the Hennessy-Milner property of distinguishing co...