Sciweavers

1435 search results - page 152 / 287
» E-connections of Description Logics
Sort
View
JAPLL
2007
135views more  JAPLL 2007»
15 years 1 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»
15 years 1 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
IDT
2010
124views more  IDT 2010»
14 years 12 months ago
Modelling decision making with probabilistic causation
Humans know how to reason based on cause and effect, but cause and effect is not enough to draw conclusions due to the problem of imperfect information and uncertainty. To resol...
Luís Moniz Pereira, Carroline Kencana Ramli
ESWS
2009
Springer
15 years 8 months ago
Decidability of SHI with Transitive Closure of Roles
This paper investigates a Description Logic, namely SHI+, which extends SHI by adding transitive closure of roles. The resulting logic SHI+ allows transitive closure of roles to oc...
Chan Le Duc
KI
2007
Springer
15 years 7 months ago
Relational Exploration - Reconciling Plato and Aristotle
Abstract. We provide an interactive method for knowledge acquisition combining approaches from description logic and formal concept analysis. Based on present data, hypothetical ru...
Sebastian Rudolph