Sciweavers

3032 search results - page 48 / 607
» Description Logic Rules
Sort
View
CORR
2007
Springer
119views Education» more  CORR 2007»
13 years 10 months ago
Using Description Logics for Recognising Textual Entailment
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...
Paul Bedaride
JAPLL
2007
135views more  JAPLL 2007»
13 years 10 months ago
Open answer set programming for the semantic web
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
AIL
2000
78views more  AIL 2000»
13 years 10 months ago
Representation of formal dispute with a standing order
Computational dialectics is a relatively new field. It is, among others, concerned with the formal representation of argument and dispute. The goal is to suggest algorithms, proce...
Gerard Vreeswijk
DAGSTUHL
2007
13 years 11 months ago
Parallel universes to improve the diagnosis of cardiac arrhythmias
arrhythmias (extended abstract) Elisa Fromont, Ren´e Quiniou, Marie-Odile Cordier We are interested in using parallel universes to learn interpretable models that can be subseque...
Élisa Fromont, Rene Quiniou, Marie-Odile Co...
LPAR
2004
Springer
14 years 3 months ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel