Sciweavers

1948 search results - page 197 / 390
» Formalizing Mirror Theory
Sort
View
COCO
2000
Springer
112views Algorithms» more  COCO 2000»
15 years 11 months ago
Combinatorial Interpretation of Kolmogorov Complexity
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...
Andrei E. Romashchenko, Alexander Shen, Nikolai K....
LPNMR
1993
Springer
15 years 10 months ago
An Assumption-Based Framework for Non-Monotonic Reasoning
The notion of assumption-based framework generalises and re nes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-mon...
Andrei Bondarenko, Francesca Toni, Robert A. Kowal...
KR
2000
Springer
15 years 10 months ago
A Logic Based Language for Parametric Inheritance
Though overriding as a single and default mode of inheritance is adequate for most knowledge bases, a large class of applications naturally requires several inheritance modes and ...
Hasan M. Jamil
ACM
1995
15 years 10 months ago
Rough Sets
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...
Zdzislaw Pawlak
ATAL
2009
Springer
15 years 10 months ago
Normative framework for normative system change
Normative systems in a multiagent system must be able to evolve over time, for example due to actions creating or removing norms in the system. The only formal framework to evalua...
Guido Boella, Gabriella Pigozzi, Leendert van der ...