The SLD resolution proof theory for the Prolog family of logicprogramming languages is well known. The extended syntactic forms of these languages, however, distance them from the Horn language required by SLD resolu...
详细信息
Analyzing conformance of execution traces with clinical guidelines is not a trivial task, because guidelines are developed for physicians who should always interpret them according to their general knowledge;their app...
详细信息
ISBN:
(纸本)9783319265858;9783319265841
Analyzing conformance of execution traces with clinical guidelines is not a trivial task, because guidelines are developed for physicians who should always interpret them according to their general knowledge;their application to the specific conditions of a patient or a specific context cannot always be foreseen in the guideline specification. In this paper we consider the conformance problem not only for the sequence of action execution events, but also for their timing: the guideline may include temporal constraints for the execution of actions, and its adaptation to a specific patient and context may add or modify conditions and temporal constraints for actions. We propose an approach for analyzing execution traces in Answer Set programming with respect to a guideline and Basic Medical knowledge, pointing out discrepancies - including temporal discrepancies - with respect to the different knowledge sources.
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.
We introduce a representation of agents by means of theories, and a cortmaunication among agents based on reflection, within the metalogicprogramming paradigm. The semantics of these features is shown to be the class...
详细信息
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.
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...
详细信息
We present an advanced approach to representing knowledge about breast radiographs or mammograms which has advantages in terms of both usability and software engineering. The approach uses ontologies to create not mer...
详细信息
暂无评论