261.
Temporal Logic Of Processes
. In many so called interactive applications we are interested not only
in the result of a program as a function of its input, but mainly in the behavior
of the program while it is running. Such interactive programs are often described
by execution traces, which are chronological sequences of states of the program
during its execution.
In this paper a logic for describing processes -- generalizations of execution
traces is presented. It is shown that expressive power of this logic is not worse
than that of first order temporal logic. Moreover, due to the fact that in the
definition of semantic of our logic no notion of...
262.
Nonstandard Consequence Operators Generated By Mixed Logic-Systems
- Herrmann, Robert A.
Mixed logic-systems contain both standard and nonstandard coordinate values.
In this paper, it is shown that each of the specifically defined mixed
logic-systems generates an internal nonstandard consequence operator.
263.
Logical Control of an Elevator with Defeasible Logic
- Michael A. Covington
The elevator control program described in this journal by Dyck and Caines [2] can be implemented more concisely in d-Prolog, a defeasible logic programming system developed by Nute [3, 4, 5]. In defeasible logic, more specific rules take precedence over more general ones. Thus, the d-Prolog programmer can state general rules and then give explicit exceptions, just as humans do when explaining complex regularities to each other. Keywords: logic modeling, defeasible logic, defaults, elevator 1
264.
Temporal Disjunctive Logic Programming
- Manolis Gergatsoulis; Panos Rondogiannis; Themis Panayiotopoulos
In this paper we introduce the logic programming language Disjunctive Chronolog which combines the programming paradigms of temporal and disjunctive logic programming. Disjunctive Chronolog is capable of expressing dynamic behaviour as well as uncertainty, two notions that are very common in a variety of real systems. We present the minimal temporal model semantics and the fixpoint semantics for the new programming language and demonstrate their equivalence. We also show how proof procedures developed for disjunctive logic programs can be easily extended to apply to Disjunctive Chronolog programs.
265.
State Clock Logic: a Decidable Real-Time Logic
- Pierre-yves Schobbens
In this paper we define a real-time logic called SC logic. This logic is defined in the framework of State Clock automata, the state variant of the Event Clock automata of Alur et al [6]. Unlike timed automata [4], they are complementable and thus language inclusion becomes decidable. SC automata and SC logic are less expressive than timed automata and MITL but seem expressive enough in practice. A procedure to translate each SC formula into a SC automaton is presented. The main contribution of this paper is to complete the framework of this class of determinizable automata with a temporal...
266.
The logic of relative systems
- Ressler, M. R.
This study aims to develop the logic of relativism, then to apply that logic to the question of self-refutation in relativism.
267.
A Framework for Incorporating Abstraction Mechanisms into the Logic Programming Paradigm
- Into The; Joseph Lawrence Zachary; Joseph Lawrence Zachary
To help make logic programming more suitable for writing large systems, we develop linguistic mechanisms that permit the organization of logic programs around abstractions. In particular, we present the design of Denali, an equational logic programming language that supports predicate and data abstraction.
268.
Fuzzy Logic Based Regression Models for Electronics Manufacturing Applications
- Brian Schaible; Y. C. Lee
fuzzy logic to solve problems that were previously assumed difficult to solve. These include, for example, the use of fuzzy logic for control and pattern recognition. However, the application of fuzzy logic to the establishment of correlations between independent and dependent process variables, i.e. regression modeling, has received less attention.
269.
Categorical Abstract Algebraic Logic: More on Protoalgebraicity
- Voutsadakis, George
Protoalgebraic logics are characterized by the monotonicity of the Leibniz operator on their theory lattices and are at the lower end of the Leibniz hierarchy of abstract algebraic logic. They have been shown to be the most primitive among those logics with a strong enough algebraic character to be amenable to algebraic study techniques. Protoalgebraic ?-institutions were introduced recently as an analog of protoalgebraic sentential logics with the goal of extending the Leibniz hierarchy from the sentential framework to the ?-institution framework. Many properties of protoalgebraic logics, studied in the sentential logic framework by Blok and Pigozzi, Czelakowski, and Font...
270.
A reduction-based theorem prover for 3-valued logic
- Aguilera Venegas, G.; Ojeda Aciego, Manuel; Guzmán, I. P. de
We present a new prover for propositional 3-valued logics, TAS-M3, which is an extension of the TAS-D prover for classical propositional logic. TAS-M3 uses the TAS methodology and, consequently, it is a reduction-based method. Thus, its power is based on the reductions of the size of the formula executed by the F transformation. This transformation dynamically filters the information contained in the syntactic structure of the formula to avoid as much distributions as possible, in order to improve efficiency. In our opinion, this filtering is the key of the TAS methodology which, as shown in this paper, allows the method...
271.
Dynamic Composition of Parameterised Logic Modules
- Antonio Brogi; Chiara Renso; Franco Turini
We present a logic-based programming language that features meta-level composition operations over programs. Object programs are parameterised named collections of denite clauses which may contain formulae of the form A in Pexp, where A is a standard atomic formula and Pexp is a program expression obtained by applying composition operations over named object programs. The semantics of the language is presented in two dierent equivalent styles. An operational, top-down semantics is given by means of inference rules, while a denotational, bottom-up semantics is given via an immediate consequence operator associated with program expressions. A meta-programming implementation of the language is...
272.
A Decision Algorithm for Full Propositional Temporal Logic
- Kesten Manna Mcguire; Y. Kesten; Z. Manna; H. Mcguire; A. Pnueli
The paper presents an efficient algorithm for checking the satisfiability of a propositional linear time temporal logic formula, which may have past as well as future operators. This algorithm can be used to check validity of such formulas over all models as well as over computations of a finite-state program (model checking). Unlike previous theoretical presentations of a decision method for checking satisfiability or validity, whose first step is to construct the full set of all possible atoms of a tableau (satisfaction graph) and immediately pay the worst case exponential complexity price, the algorithm presented here builds the tableau incrementally...
273.
Logic Grammars and λProlog
- Serge Le Huitouze; Pascale Louvet; Olivier Ridoux
A logic grammar formalism called DCG (Definite Clause Grammars), which has proved to be useful, is part of most Prolog implementations. We develop two new logic grammar formalisms called DCG' and HHG (higher-order Hereditary Harrop Grammars) that can be used in Prolog implementations. The relations between DCG, DCG', and HHG, and Prolog and Prolog can be illustrated by the following diagram: DCG --3--? DCG' --------4---------? LambdaHHG --- " --- 1 --- "3 --- 4 --- " --- v v v Prolog -------------------2---------? LambdaProlog 1. The language Prolog, the DCG formalism, and the translation of DCG into Prolog by Prolog are...
274.
ESTL: A Temporal Logic for Events and States
- Ekkart Kindler; Tobias Vesper
. In some phases of system development state-based methods are adequate; in others event-based methods are adequate. Petri nets provide a system model which supports both methods and thus allow a smooth transition between the different phases of system development. Most temporal logics for Petri nets, however, do not support both methods. In this paper we introduce a temporal logic for Petri nets which allows to argue on states as well as on events. This way, specifications in the early phases can be event based and verification in later phases can be state-based within a single formalism. Keywords: Temporal logic;...
275.
A Decision Algorithm for Full Propositional Temporal Logic
- Y. Kesten; Zohar Manna; Z. Manna; Amir Pnueli; H. Mcguire; A. Pnueli
The paper presents an efficient algorithm for checking the satisfiability of a propositional linear time temporal logic formula, which may have past as well as future operators. This algorithm can be used to check validity of such formulas over all models as well as over computations of a finite-state program (model checking). Unlike previous theoretical presentations of a decision method for checking satisfiability or validity, whose first step is to construct the full set of all possible atoms of a tableau (satisfaction graph) and immediately pay the worst case exponential complexity price, the algorithm presented here builds the tableau incrementally....
276.
A Decision Algorithm for Full Propositional Temporal Logic
- Kesten Manna; Y. Kesten; Z. Manna; H. Mcguire; A. Pnueli
The paper presents an efficient algorithm for checking the satisfiability of a propositional linear time temporal logic formula, which may have past as well as future operators. This algorithm can be used to check validity of such formulas over all models as well as over computations of a finite-state program (model checking). Unlike previous theoretical presentations of a decision method for checking satisfiability or validity, whose first step is to construct the full set of all possible atoms of a tableau (satisfaction graph) and immediately pay the worst case exponential complexity price, the algorithm presented here builds the tableau incrementally....
277.
The stratix ii logic and routing architecture
- David Lewis; Elias Ahmed; Gregg Baeckler; Vaughn Betz; Mark Bourgeault; David Galloway; Mike Hutton; Chris Lane; Andy Lee; Paul Leventis; Cameron Mcclintock; Ketan Padalia; Bruce Pedersen; Giles Powell; Boris Ratchev; Srinivas Reddy; Jay Schleicher; Kevin Stevens; Richard Yuan; Richard Cliff; Jonathan Rose
This paper describes the Altera Stratix II ™ logic and routing architecture. This architecture features a novel adaptive logic module (ALM) that is based on a 6-LUT, but can be partitioned into two smaller LUTs to efficiently implement circuits containing a range of LUT sizes that arises in conventional synthesis flows. This provides a performance increase of 15 % in the Stratix II architecture while reducing area by 2%. The ALM also includes a more powerful arithmetic structure that can perform two bits of arithmetic per ALM, and perform a sum of up to three inputs. The routing fabric adds...
278.
The stratix ii logic and routing architecture
- David Lewis; Elias Ahmed; Gregg Baeckler; Vaughn Betz; Mark Bourgeault; David Galloway; Mike Hutton; Chris Lane; Andy Lee; Paul Leventis; Cameron Mcclintock; Ketan Padalia; Bruce Pedersen; Giles Powell; Boris Ratchev; Srinivas Reddy; Jay Schleicher; Kevin Stevens; Richard Yuan; Richard Cliff; Jonathan Rose
This paper describes the Altera Stratix II ™ logic and routing architecture. This architecture features a novel adaptive logic module (ALM) that is based on a 6-LUT, but can be partitioned into two smaller LUTs to efficiently implement circuits containing a range of LUT sizes that arises in conventional synthesis flows. This provides a performance increase of 15 % in the Stratix II architecture while reducing area by 2%. The ALM also includes a more powerful arithmetic structure that can perform two bits of arithmetic per ALM, and perform a sum of up to three inputs. The routing fabric adds...
279.
Complexity and Succinctness of Public Announcement Logic
There is a recent trend of extending epistemic logic (EL) with dynamic operators that allow to express the evolution of knowledge and induced by knowledge-changing actions. The most basic such extension is public announcement logic (PAL), which is obtained from EL by adding an operator for truthful public announcements. In this paper, we consider the computational complexity of PAL and show that it coincides with that of EL. This holds in the single- and multi-agent case, and also in the presence of common knowledge operators. We also prove that there are properties that can be expressed exponentially more succinct in...
280.
The stratix ii logic and routing architecture
- David Lewis; Elias Ahmed; Gregg Baeckler; Vaughn Betz; Mark Bourgeault; David Galloway; Mike Hutton; Chris Lane; Andy Lee; Paul Leventis; Cameron Mcclintock; Ketan Padalia; Bruce Pedersen; Giles Powell; Boris Ratchev; Srinivas Reddy; Jay Schleicher; Kevin Stevens; Richard Yuan; Richard Cliff; Jonathan Rose
This paper describes the Altera Stratix II ™ logic and routing architecture. This architecture features a novel adaptive logic module (ALM) that is based on a 6-LUT, but can be partitioned into two smaller LUTs to efficiently implement circuits containing a range of LUT sizes that arises in conventional synthesis flows. This provides a performance increase of 15 % in the Stratix II architecture while reducing area by 2%. The ALM also includes a more powerful arithmetic structure that can perform two bits of arithmetic per ALM, and perform a sum of up to three inputs. The routing fabric adds...
