this paper is an approach to automated verification of circuits represented as switch-level designs. Switch-level models (SLM) are a well-established framework for modelling low-level properties of circuits. We use ma...
详细信息
ISBN:
(纸本)3540569448
this paper is an approach to automated verification of circuits represented as switch-level designs. Switch-level models (SLM) are a well-established framework for modelling low-level properties of circuits. We use many-valued propositional logic To represent a suitable variant of SLM. logical properties of circuits (gate-level) can be expressed in a standard way in the same logic. As a result we can express soundness of switch-level designs wrt to gate-level specifications as many-valued deduction problems. Recent advances in many-valued theorem proving indicate that it is possible to handle real life examples. We report first results obtained with an experimental theorem prover.
the purpose of this paper is to describe a computational model for legal reasoning in criminal law (i.e. trial reasoning). this logic-programming based model contains seven key components: facts of a new case, old cas...
详细信息
It is proposed to add bounded quantifications to Prolog. the main reason is one of natural expression, many algorithms are expressed more elegantly in a declarative way using bounded quantifications than using existin...
详细信息
ISBN:
(纸本)3540569448
It is proposed to add bounded quantifications to Prolog. the main reason is one of natural expression, many algorithms are expressed more elegantly in a declarative way using bounded quantifications than using existing means, i.e., recursion. In particular this is true for numerical algorithms, an area where Prolog has been virtually unsuccessful so far. Moreover, bounded quantification has been found to be at least as efficient as recursion, when applicable. We outline an implementation of bounded quantification through an extension of Warren's abstract Prolog machine and give performance figures relative to recursion. Finally, we have shown elsewhere that bounded quantification has a high potential for parallel implementation. One can often run the same program on a sequential computer and on several kinds of parallel computers.
An interactive, graphical activity scheduler and its implementation in an object oriented constraint logicprogramming language is described. It is known that are consistency techniques are a tractable decision proced...
详细信息
ISBN:
(纸本)185166839X
An interactive, graphical activity scheduler and its implementation in an object oriented constraint logicprogramming language is described. It is known that are consistency techniques are a tractable decision procedure for the temporal constraint networks examined here. the application described permits the specification of any of Allen's 13 binary temporal constraints on activities and thus subsumes precedence scheduling. Arc consistency and intelligent backtracking are part of the scheduler simply as a by-product of the chosen programming language. the result is a natural elegant implementation - which supports incremental and reactive scheduling-that required an astonishingly small amount of coding effort. though the focus is methodology, a comparison of this approach with previous results in temporal constraint satisfaction and representations of temporal reasoning is also included.
We present an operational process model for default logicthat allows calculation of the extensions of a theory, and give a prototypical Prolog implementation. then we present an improved approach for realizing the pr...
详细信息
the purpose of this paper is to describe a computational model for legal reasoning in criminal law (i.e. trial reasoning). this logic-programming based model contains seven key components: facts of a new case, old cas...
ISBN:
(纸本)0897916069
the purpose of this paper is to describe a computational model for legal reasoning in criminal law (i.e. trial reasoning). this logic-programming based model contains seven key components: facts of a new case, old cases, domain knowledge, meta rules, similarity matching relations, various implications, and two explicit agents, the plaintiff and the defendant, with opposing goals and reasoning strategies. the argumentation process in this model can be likened to a two-agent game. One agent puts forward an argument. the other agent recognizes the situation, generates candidates to refute the claim, and selects the best one for the next move. the game ends when any one agent can no longer make a move. Certain debate strategies of this model are illustrated in this paper with examples. In addition, the computational model presented has been used in the design and development of HELIC-II - a parallel knowledge-based system for trial reasoning.
We present a generic method to obtain resolution systems for modal propositional logics. the rules of a resolution system for a modal logic can be derived from the frame properties that characterize the logic. We char...
详细信息
We propose to use the logic of only knowing (OL) by Levesque [6] as a unified framework that encompasses various non-monotonic formalisms and logicprogramming. OL is a modal logic which can be used to formalize an ag...
详细信息
暂无评论