51 search results - page 1 / 11 » Trichotomy in the Complexity of Minimal Inference |
LICS
2009
IEEE
13 years 11 months ago
2009
IEEE
We study the complexity of the propositional minimal inference problem. Its complexity has been extensively studied before because of its fundamental importance in artificial int...
WABI
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. A recursive algorithm by Aho, Sagiv, Szymanski, and Ullman [1] forms the basis for many modern rooted supertree methods employed in Phylogenetics. However, as observed by...
BSL
2004
13 years 4 months ago
2004
This paper ties together much of the model theory of the last 50 years. Shelah's attempts to generalize the Morley theorem beyond first order logic led to the notion of excel...
JOLLI
1998
13 years 4 months ago
1998
When reasoning about complex domains, where information available is usually only partial, nonmonotonic reasoning can be an important tool. One of the formalisms introduced in thi...
TAPSOFT
1991
Springer
13 years 8 months ago
1991
Springer
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...