Sciweavers

154 search results - page 17 / 31
» Some Logical Properties of Nonmonotonic Causal Theories
Sort
View
AI
2006
Springer
13 years 7 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
FSTTCS
1999
Springer
13 years 11 months ago
Explicit Substitutions and Programming Languages
The λ-calculus has been much used to study the theory of substitution in logical systems and programming languages. However, with explicit substitutions, it is possible to get fi...
Jean-Jacques Lévy, Luc Maranget
RSCTC
2000
Springer
144views Fuzzy Logic» more  RSCTC 2000»
13 years 11 months ago
Valued Tolerance and Decision Rules
In this paper we introduce the concept of valued tolerance as an extension of the usual concept of indiscernibility (which is a crisp equivalence relation) in rough sets theory. So...
Jerzy Stefanowski, Alexis Tsoukiàs
AI
2007
Springer
13 years 7 months ago
On the evaluation of argumentation formalisms
Argumentation theory has become an important topic in the field of AI. The basic idea is to construct arguments in favor and against a statement, to select the “acceptable” o...
Martin Caminada, Leila Amgoud
AGP
1998
IEEE
13 years 11 months ago
Dynamic Logic Programming
In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow de...
José Júlio Alferes, João Alex...