105 search results - page 4 / 21 » Automated Reasoning in Some Local Extensions of Ordered Stru... |
100
click to vote
TPHOL
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
125
click to vote
DLOG
2009
14 years 10 months ago
2009
Abstract This paper analyzes the probabilistic description logic PSHIQ by looking at it as a fragment of probabilistic first-order logic with semantics based on possible worlds. We...
124
click to vote
DLOG
2009
14 years 10 months ago
2009
Abstract. Model-based most specific concepts are a non-standard reasoning service in Description Logics. They have turned out to be useful in knowledge base completion for ontologi...
114
click to vote
CADE
2005
Springer
16 years 18 days ago
2005
Springer
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
104
click to vote
LPAR
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Matching is a basic operation extensively used in computation. Second-order matching, in particular, provides an adequate environment for expressing program transformatio...