507 search results - page 72 / 102 » Automating first-order relational logic |
88
Voted
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
137
click to vote
LICS
2006
IEEE
15 years 6 months ago
2006
IEEE
We present an expressiveness study of linearity and persistence of processes. We choose the π-calculus, one of the main representatives of process calculi, as a framework to cond...
106
Voted
ICLP
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis...
80
Voted
ICLP
1987
Springer
15 years 4 months ago
1987
Springer
The Near-Horn Prolog procedures have been proposed as e ective procedures in the area of disjunctive logic programming, an extension of logic programming to the ( rstorder) non-Ho...
108
Voted
ICCBR
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. Retrieval of structured cases using similarity has been studied in CBR but there has been less activity on defining similarity on description logics (DL). In this paper w...