The study of strong equivalence between logic programs or nonmonotonic theories under answer set semantics, begun in [18], is extended to the case where the programs or theories concerned are formulated in different l...
详细信息
ISBN:
(纸本)1586034529
The study of strong equivalence between logic programs or nonmonotonic theories under answer set semantics, begun in [18], is extended to the case where the programs or theories concerned are formulated in different languages. We suggest that theories in different languages be considered equivalent in the strong sense or synonymous if and only if each is bijectively interpretable (hence translatable) into the other. Since the logic of here-and-there, which provides a suitable foundation for answer set programming, has the Beth property, we can easily give model-theoretic conditions that are equivalent to bijective interpretability. These conditions involve mappings between the models of the two theories that, in particular, preserve the property of being an answer set or equilibrium model.
In this article, we present a first-order logic programming language for fuzzy reasoning under possibilistic uncertainty and poorly known information. Formulas are represented by a pair (phi, alpha), in which p is a f...
详细信息
In this article, we present a first-order logic programming language for fuzzy reasoning under possibilistic uncertainty and poorly known information. Formulas are represented by a pair (phi, alpha), in which p is a first-order Horn clause or a query with fuzzy constants and regular predicates, and alpha is an element of [0, 1] is a lower bound on the belief on phi in terms of necessity measures. Since fuzzy constants can occur in the logic component of formulas, the truth value of formulas is many-valued instead of Boolean. Moreover, since we have to reason about the possibilistic uncertainty of formulas with fuzzy constants, belief states are modeled by normalized possibility distributions on a set of many-valued interpretations. In this framework, (1) we define a syntax and a semantics of the underlying logic;(2) we give a sound modus ponens-style calculus by derivation based on a semantic unification pattern of fuzzy constants;(3) we develop a directional fuzzy unification algorithm based on the distinction between general and specific object constants;and (4) we describe a backward first-order proof procedure oriented to queries that is based on the calculus of the language and the computation of the unification degree between fuzzy constants in terms of a necessity measure for fuzzy events. (C) 2002 Wiley Periodicals, Inc.
We present a new method of logic-Based Genetic programming (LBGP) using Prolog programming framework. Using the intrinsic mechanism of backtracking in Prolog, we are able to (i) design flexible genetic operations effe...
详细信息
ISBN:
(纸本)0780385667
We present a new method of logic-Based Genetic programming (LBGP) using Prolog programming framework. Using the intrinsic mechanism of backtracking in Prolog, we are able to (i) design flexible genetic operations effective to the smaller sizes of populations, and (ii) to maintain the population diversity of individual programs with both active structures (or exons) and inactive structures (or introns) generated by the genetic operations. We will apply the method to obtaining multiple solutions for multi-modal problems. We validate the effectiveness of LBGP to get multiple solutions on Tree Constructional and Tile World problems.
This paper is an analysis of two knowledge representation extensions of logic programming, namely Answer Set programming and ID-logic. Our aim is to compare both logics on the level of declarative reading, practical m...
详细信息
ISBN:
(数字)9783540302278
ISBN:
(纸本)3540232427
This paper is an analysis of two knowledge representation extensions of logic programming, namely Answer Set programming and ID-logic. Our aim is to compare both logics on the level of declarative reading, practical methodology and formal semantics. At the level of methodology, we put forward the thesis that in many (but not all) existing applications of ASP, an ASP program is used to encode definitions and assertions, similar as in ID-logic. We illustrate this thesis with an example and present a formal result that supports it, namely an equivalence preserving translation from a class of ID-logic theories into ASP. This translation can be exploited also to use the current efficient ASP solvers to reason on ID-logic theories and it has been used to implement a model generator for ID-logic.
Inductive logic programming, or relational learning, is a powerful paradigm for machine learning or data mining. However, in order for ILP to become practically useful, the efficiency of ILP systems must improve subst...
详细信息
Inductive logic programming, or relational learning, is a powerful paradigm for machine learning or data mining. However, in order for ILP to become practically useful, the efficiency of ILP systems must improve substantially. To this end, the notion of a query pack is introduced: it structures sets of similar queries. Furthermore, a mechanism is described for executing such query packs. A complexity analysis shows that considerable efficiency improvements can be achieved through the use of this query pack execution mechanism. This claim is supported by empirical results obtained by incorporating support for query pack execution in two existing learning systems.
This paper deals with the implementation of globally asynchronous locally synchronous (GALS), micropipelined processor in field programmable gate arrays (FPGA). Associated issues like delay model incorporating on-chip...
详细信息
This paper deals with the implementation of globally asynchronous locally synchronous (GALS), micropipelined processor in field programmable gate arrays (FPGA). Associated issues like delay model incorporating on-chip, technology independent single inverter ring oscillator (SIRO) and an unbundled datapath based on bit-encoding and return-to-zero (RTZ) schemes are also presented. Post-layout simulation results are presented to describe the behavior of various sections of the design
This paper concerns the realization of an adaptable protocol processing unit (PPU) targeting reconfigurable SoCs in mobile communication applications. The PPU is based on our design technique for dense-coded programma...
详细信息
This paper concerns the realization of an adaptable protocol processing unit (PPU) targeting reconfigurable SoCs in mobile communication applications. The PPU is based on our design technique for dense-coded programmable finite state machines. This approach reduces programming costs by combining memory-based function generators with reconfigurable logic. Furthermore, we added custom modules that implement application-specific logic and arithmetic operations to achieve proper results.
This paper describes the architecture of a visual surveillance system that combines real time computer vision algorithms with logic programming to represent and recognize activities involving interactions amongst peop...
详细信息
This paper describes the architecture of a visual surveillance system that combines real time computer vision algorithms with logic programming to represent and recognize activities involving interactions amongst people, packages and the environments through which they move. The low level computer vision algorithms log primitive events of interest as observed facts, while the higher level Prolog based reasoning engine uses these facts in conjunction with predefined rules to recognize various activities in the input video streams. The system is illustrated in action on a multi-camera surveillance scenario that includes both security and safety violations.
暂无评论