300 search results - page 21 / 60 » The Extension Theorem |
LPNMR
1997
Springer
15 years 3 months ago
1997
Springer
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
JSYML
2011
14 years 6 months ago
2011
Abstract. This paper introduces a natural extension of Kolchin’s differential Galois theory to positive characteristic iterative differential fields, generalizing to the non-li...
116
click to vote
AIML
2004
15 years 14 days ago
2004
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
76
Voted
LICS
2008
IEEE
15 years 5 months ago
2008
IEEE
— This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Σ1 formulas. This is a tree extension of the Simon theorem,...
68
Voted
DM
2006
14 years 11 months ago
2006
We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph of G. The condition is derived from a re...