3032 search results - page 191 / 607 » Description Logic Rules |
108
Voted
EUSFLAT
2003
15 years 2 months ago
2003
Let C be the propositional calculus given by a standard SBL-algebra; C is obtained from C by adding an involutive negation, with axioms and deduction rules as in [4]. Then C i...
131
click to vote
TABLEAUX
2009
Springer
15 years 7 months ago
2009
Springer
We see cut-free sequent systems for the basic normal modal logics formed by any combination the axioms d, t, b, 4, 5. These systems are modular in the sense that each axiom has a c...
126
Voted
GRC
2005
IEEE
15 years 6 months ago
2005
IEEE
— In this article, a formalism for a specific temporal data mining task (the discovery of rules, inferred from databases of events having a temporal dimension), is defined. The...
99
Voted
IAT
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper we present a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is ext...
99
Voted
SAINT
2005
IEEE
15 years 6 months ago
2005
IEEE
This paper discusses a methodology for applying general-purpose first-order inductive learning to extract information from Web documents structured as unranked ordered trees. The...