Sciweavers

2035 search results - page 93 / 407
» On the complexity of stratified logics
Sort
View
AIR
2010
96views more  AIR 2010»
15 years 7 months ago
Logic programming for combinatorial problems
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for...
Toshinori Munakata, Roman Barták
KBS
2011
81views more  KBS 2011»
15 years 1 months ago
Existential rigidity and many modalities in order-sorted logic
Order-sorted logic is a useful tool for knowledge representation and reasoning because it enables representation of sorted terms and formulas along with partially ordered sorts (c...
Ken Kaneiwa
RR
2009
Springer
16 years 1 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 6 months 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
IGPL
1998
97views more  IGPL 1998»
15 years 6 months 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