Finite failure of computations plays an important role as programming construct in the logicprogramming paradigm, and it has been shown that this also extends to the case of the functional logicprogramming paradigm....
详细信息
this paper proposes probabilistic default reasoning as a suitable approach to inheritance and recognition in uncertain and fuzzy object-oriented models. Firstly, we introduce an uncertain and fuzzy object-oriented mod...
详细信息
ISBN:
(纸本)0780370783
this paper proposes probabilistic default reasoning as a suitable approach to inheritance and recognition in uncertain and fuzzy object-oriented models. Firstly, we introduce an uncertain and fuzzy object-oriented model where a class property (i.e., an attribute or a method) can contain fuzzy sets interpreted as families of probability distributions, and uncertain class membership and property applicability are measured by lower and upper bounds on probability. Each uncertainly applicable property is interpreted as a default probabilistic logic rule, which is defeasible. In order to reduce the computational complexity of general probabilistic default reasoning, we propose to use Jeffrey's rule for a weaker notion of consistency and for local inference, then apply them to uncertain inheritance of properties. Using the same approach but with inverse Jeffrey's rule, uncertain recognition as probabilistic default reasoning is also presented. the approach is illustrated by an example in Fril++, the uncertain and fuzzy object-oriented logicprogramming language that we have been developing.
logical omniscience is a well known problem which makes traditional modal logics of knowledge, belief and intentions somewhat unrealistic from the point of view of modelling the behaviour of a resource bounded agent. ...
详细信息
作者：
Koriche, FrédéricLIRMM
UMR 5506 Université Montpellier II CNRS 161 rue Ada Montpellier Cedex 534392 France
In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the first-order case is only semi-decidable. Even in...
详细信息
Numerical computations form an essential part of almost any real-world program. Clearly, in order for a termination analyser to be of practical use it should contain a mechanism for inferring termination of such compu...
详细信息
ISBN:
(纸本)9783540429579
Numerical computations form an essential part of almost any real-world program. Clearly, in order for a termination analyser to be of practical use it should contain a mechanism for inferring termination of such computations. However, this topic attracted less attention of the research community. In this work we concentrate on automatic termination inference for logic programs depending on numerical computations. Dershowitz et al. [8] showed that termination of general numerical computations, for instance on floating point numbers, may be counter-intuitive, i.e., the observed behaviour does not necessarily coincide withthe theoretically expected one. thus, we restrict ourselves to integer computations only.
Default logic is recognized as a powerful framework for knowledge representation and incomplete information management. Its expressive power is suitable for non monotonic reasoning, but the counterpart is its very hig...
详细信息
this paper motivates and introduces entailment problems over nonmonotonic theories some of whose predicates - called open predicates - are not (completely) specified. More precisely, we are interested in those inferen...
详细信息
We introduce a methodology and framework for expressing general preference information in logicprogramming under the answer set semantics. At first, we are interested in semantical underpinnings for existing approach...
ISBN:
(纸本)9783540424642
We introduce a methodology and framework for expressing general preference information in logicprogramming under the answer set semantics. At first, we are interested in semantical underpinnings for existing approaches to preference handling in extended logicprogramming. To begin with, we explore three different approaches that have been recently proposed in the literature. Because these approaches use rather different formal means, we furnish a uniform characterizations that allows us to gain insights into the relationships among these approaches.
the language Ε for reasoning about actions and change can be translated into an argumentation framework. In this paper, we extend this translation of the basic language and showhowit can, together with methods from a...
详细信息
While negation has been a very active area of research in logicprogramming, comparatively few papers have been devoted to implementation issues. Furthermore, the negation-related capabilities of current Prolog system...
详细信息
暂无评论