Sciweavers

2022 search results - page 100 / 405
» Complexity of Non-Monotonic Logics
Sort
View
142
Voted
RR
2009
Springer
15 years 7 months ago
Paraconsistent Reasoning for OWL 2
Abstract. A four-valued description logic has been proposed to reason with description logic based inconsistent knowledge bases. This approach has a distinct advantage that it can ...
Yue Ma, Pascal Hitzler
ML
2006
ACM
122views Machine Learning» more  ML 2006»
15 years 21 days ago
PRL: A probabilistic relational language
In this paper, we describe the syntax and semantics for a probabilistic relational language (PRL). PRL is a recasting of recent work in Probabilistic Relational Models (PRMs) into ...
Lise Getoor, John Grant
98
Voted
IGPL
1998
97views more  IGPL 1998»
15 years 13 days ago
Towards Structurally-Free Theorem Proving
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
Marcelo Finger
ICFCA
2004
Springer
15 years 6 months ago
Background Knowledge in Concept Graphs
Traditional logic can be understood as the investigation of the three main essential functions of thinking – concepts, judgements and conclusions. In the last years, in a new res...
Frithjof Dau
102
Voted
ICSE
2003
IEEE-ACM
15 years 6 months ago
Data Flow Testing as Model Checking
This paper presents a model checking-based approach to data flow testing. We characterize data flow oriented coverage criteria in temporal logic such that the problem of test ge...
Hyoung Seok Hong, Sung Deok Cha, Insup Lee, Oleg S...