Sciweavers

3244 search results - page 359 / 649
» Extensions to Description Logics
Sort
View
KR
2000
Springer
15 years 10 months ago
Finding Admissible and Preferred Arguments Can be Very Hard
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
ICLP
1987
Springer
15 years 10 months ago
Near-Horn PROLOG
The Near-Horn Prolog procedures have been proposed as e ective procedures in the area of disjunctive logic programming, an extension of logic programming to the ( rstorder) non-Ho...
Donald W. Loveland
CSL
2008
Springer
15 years 8 months ago
Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars
Abstract. We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by ch...
Ruzica Piskac, Viktor Kuncak
FOIS
2006
15 years 8 months ago
PR-OWL: A Framework for Probabilistic Ontologies
Abstract. Across a wide range of domains, there is an urgent need for a wellfounded approach to incorporating uncertain and incomplete knowledge into formal domain ontologies. Alth...
Paulo Cesar G. da Costa, Kathryn B. Laskey
CLEIEJ
2006
88views more  CLEIEJ 2006»
15 years 6 months ago
A Stochastic Concurrent Constraint Based Framework to Model and Verify Biological Systems
Concurrent process calculi are powerful formalisms for modelling concurrent systems. The mathematical style underlying process calculi allow to both model and verify properties of...
Carlos Olarte, Camilo Rueda