1321 search results - page 145 / 265 » Subtyping in Logical Form |
162
click to vote
KSEM
2007
Springer
16 years 16 days ago
2007
Springer
We define an inference system to capture explanations based on causal statements, using an ontology in the form of an IS-A hierarchy. We first introduce a simple logical language...
179
click to vote
FCT
2005
Springer
15 years 12 months ago
2005
Springer
We consider terms of simply typed lambda calculus in which copy of a subterm may not be inserted to the argument of itself during the reduction. The terms form wide class which inc...
164
click to vote
ECAI
2004
Springer
15 years 11 months ago
2004
Springer
This paper constructs a logic of soft constraints where the set of degrees of preference forms a partially ordered set. When the partially ordered set is a distributive lattice, th...
188
click to vote
RSCTC
2004
Springer
15 years 11 months ago
2004
Springer
We address the problem of rough applicability of rules within the framework of approximation spaces. The graded applicability of a rule for an object of an approximation space, int...
178
click to vote
ASP
2003
Springer
15 years 11 months ago
2003
Springer
We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. To this end, we develop a series of operational chara...