1486 search results - page 128 / 298 » A Logically Saturated Extension of |
174
click to vote
NMR
2004
Springer
15 years 11 months ago
2004
Springer
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive...
185
click to vote
RULEML
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is, among others, useful for ontology i...
173
click to vote
FTRTFT
1998
Springer
15 years 10 months ago
1998
Springer
PLC-Automata are a class of real-time automata suitable to describe the behavior of polling real-time systems. PLC-Automata can be compiled to source code for PLCs, a hardware wide...
192
click to vote
LPKR
1997
Springer
15 years 10 months ago
1997
Springer
We present the system LAP (Learning Abductive Programs) that is able to learn abductive logic programs from examples and from a background abductive theory. A new type of induction...
150
click to vote
ECAI
1994
Springer
15 years 10 months ago
1994
Springer
Default logic, one of the best known formalisms to express common sense reasoning, does not allow to reason by cases in its standard formulations. We propose a natural and easy way...