Sciweavers

29 search results - page 1 / 6
» Hybrid Reasoning with Forest Logic Programs
Sort
View
ESWS
2009
Springer
13 years 11 months ago
Hybrid Reasoning with Forest Logic Programs
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasonin...
Cristina Feier, Stijn Heymans
CORR
2010
Springer
68views Education» more  CORR 2010»
13 years 5 months ago
An Optimization for Reasoning with Forest Logic Programs
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
Cristina Feier, Stijn Heymans
JAPLL
2007
135views more  JAPLL 2007»
13 years 4 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
PERCOM
2007
ACM
13 years 11 months ago
A Performance Evaluation of Ontology-Based Context Reasoning
The CARE middleware aims at supporting contextaware adaptation of Internet services in a mobile computing environment. The CARE hybrid reasoning mechanism is based on a loose inte...
Alessandra Agostini, Claudio Bettini, Daniele Ribo...
LFCS
2007
Springer
13 years 11 months ago
A Temporal Dynamic Logic for Verifying Hybrid System Invariants
We combine first-order dynamic logic for reasoning about possible behaviour of hybrid systems with temporal logic for reasoning about the temporal behaviour during their operation...
André Platzer