In this paper we consider a logical treatment for the ordered disjunction operator × introduced by Brewka, Niemelä and Syrjänen in their logic Programs with Ordered Disjunctions (LPOD). LPODs are used t...
详细信息
Object-oriented programming and blackboard systems have proven to be two of the most successful approaches to the construction of complex software systems. Both of them rely upon the ability of maintaining either a di...
详细信息
Using SAT solvers as inference engines in answer set programming systems showed to be a promising approach in building efficient systems. Nowadays SAT based answer set programming systems successfully work with nondis...
详细信息
Using SAT solvers as inference engines in answer set programming systems showed to be a promising approach in building efficient systems. Nowadays SAT based answer set programming systems successfully work with nondis-junctive programs. This paper proposes a way to use SAT solvers for finding answer sets for disjunctive logic programs. We implement two different ways of SAT solver invocation used in nondisjunctive answer set programming. The algorithms are based on the definition of completion for disjunctive programs and the extension of loop formula to the disjunctive case. We propose the necessary modifications to the algorithms known for nondisjunctive programs in order to adapt them to the disjunctive case and demonstrate their implementation based on system CMODELS.
The VLSI implementation of arithmetic operations may be significantly improved by using non-conventional number representations and transforming intermediate results from one format to another format. For a target fun...
详细信息
ISBN:
(纸本)076951944X
The VLSI implementation of arithmetic operations may be significantly improved by using non-conventional number representations and transforming intermediate results from one format to another format. For a target function, the objective is to change the number representations of the input and output operands such that a minimum amount of logic circuitry is required to achieve a computation. Redundant arithmetic has received increasing interest in the past decade to reduce or eliminate carry propagation chains. The development of an analytical framework that expands the scope of functions that can be efficiently implemented using signed-binary representation is discussed in this paper. Implementation details are described that demonstrate the application of these results. Particular attention is placed on realizing the (a+b), -(a+b), (a-b), and -(a-b) functions in a complex +/-1 multiplier serving as a pseudonoise code scrambler in wireless CDMA transceivers.
3APL is a widely known multi-agent programming language. However, when to be used in certain domains and environments, 3APL has some limitations related to its simplistic update operator that only allows for updates t...
详细信息
This book constitutes the refereed proceedings of the 6th international Conference on Algebraic and logicprogramming, ALP '97 and the 3rdinternationalworkshop on Higher-Order Algebra, logic and Term Rewriting, ...
详细信息
ISBN:
(数字)9783540695554
ISBN:
(纸本)9783540634591
This book constitutes the refereed proceedings of the 6th international Conference on Algebraic and logicprogramming, ALP '97 and the 3rdinternationalworkshop on Higher-Order Algebra, logic and Term Rewriting, HOA '97, held jointly in Southampton, UK, in September 1997.;The 18 revised full papers presented in the book were selected from 31 submissions. The volume is divided in sections on functional and logicprogramming, higher-order methods, term rewriting, types, lambda-calculus, and theorem proving methods.
A long standing problem in logicprogramming is how to impose directionality on programs in a safe fashion. The benefits of directionality include freedom from explicit sequential control, the ability to reason about ...
详细信息
In this paper we describe a procedure for developing models und associated proof systems for two styles of paraconsistent logic. We first give an Urquhart-style representation of bounded not necessarily discrete latti...
详细信息
We examine the practicality for a user of using Answer Set programming (ASP) for representing logical formalisms. We choose as an example a formalism aiming at capturing causal explanations from causal information. We...
详细信息
A dynamic feature representation scheme is presented for non-deterministic objects with complicated images. Object symbols are dynamically generated through the interaction with computable scene in which the object fe...
详细信息
A dynamic feature representation scheme is presented for non-deterministic objects with complicated images. Object symbols are dynamically generated through the interaction with computable scene in which the object feature is modeled in terms of stochastic contraction mappings from image field into itself. Through a series of simulation studies, the scheme is demonstrated to detect and regenerate fractal objects.
暂无评论