2145 search results - page 44 / 429 » Lax Logical Relations |
PKDD
2000
Springer
14 years 1 months ago
2000
Springer
Although there is a growing need for multi-relational data mining solutions in KDD, the use of obvious candidates from the field of Inductive Logic Programming (ILP) has been limit...
ACL
2006
13 years 11 months ago
2006
We present a novel hybrid approach for Word Sense Disambiguation (WSD) which makes use of a relational formalism to represent instances and background knowledge. It is built using...
JELIA
2004
Springer
14 years 3 months ago
2004
Springer
This paper is an analysis of two knowledge representation extensions of logic programming, namely Answer Set Programming and ID-Logic. Our aim is to compare both logics on the leve...
FOSSACS
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. Among the branching-time temporal logics used for the specification and verification of systems, CTL+ , FCTL and ECTL+ are the most notable logics for which the precise...
JAIR
2008
13 years 10 months ago
2008
The notion of strong equivalence on logic programs with answer set semantics gives rise to a consequence relation on logic program rules, called SE-consequence. We present a sound...