Filters








63,660 Hits in 3.5 sec

Implicates and Reduction Techniques for Temporal Logics [chapter]

Inman P. de Guzmán, Manuel Ojeda-Aciego, Augustín Valverde
1998 Lecture Notes in Computer Science  
Reduction strategies are introduced for the future fragment of a temporal propositional logic on linear discrete time, named FNext.  ...  These reductions are based in the information collected from the syntactic structure of the formula, which allow the development of efficient strategies to decrease the size of temporal propositional formulas  ...  Conclusions and Future Work We have introduced techniques for defining and manipulating lists of unitary implicants/implicates which can improve the performance of a given prover for temporal propositional  ... 
doi:10.1007/3-540-49545-2_21 fatcat:gzfjzf7imrhkvl3a3b36xxmvoq

Page 4013 of Mathematical Reviews Vol. , Issue 2003f [page]

2003 Mathematical Reviews  
“This situation is no different for non-classical logics and, partic- ularly, for temporal logics [M.  ...  (E-MALEI; Malaga) ; Enciso, Manuel (E-MALEI; Malaga) A temporal negative normal form which preserves implicants and implicates. (English summary) J. Appl.  ... 

Bases for closed sets of implicants and implicates in temporal logic

P. Cordero, M. Enciso, I.P. de Guzmán
2002 Acta Informatica  
The information contained in temporal implicates and implicants can be used to design transformations of temporal formulae able to increase the power of automated deduction techniques for temporal logics  ...  The theory we have developed in this paper is easily extensible to cover different types of temporal logics, and is integrable in different automated deduction methods for these temporal logics.  ...  This technique renders the prover unable to compute all the information about implicants and implicates and, therefore, the reduction power is limited.  ... 
doi:10.1007/s00236-002-0087-2 fatcat:ol7776jvzzbgro2wecyejjq5u4

On Temporal and Separation Logics (Invited Paper)

Stéphane Demri, Michael Wagner
2018 International Symposium/Workshop on Temporal Representation and Reasoning  
Obviously, the introduction of temporal logics to computer science has been a major step in the development of model-checking techniques.  ...  This is also the opportunity to present bridges between well-known temporal logics and more recent separation logics.  ...  by reduction the satisfiability problem for PITL [16] .  ... 
doi:10.4230/lipics.time.2018.1 dblp:conf/time/Demri18 fatcat:hltoioogqjdoxmd5lyfgy5kwna

A New Algebraic Tool for Automatic Theorem Provers

P. Cordero, G. Gutiérrez, J. Martínez, I.P. de Guzmán
2004 Annals of Mathematics and Artificial Intelligence  
This paper concludes by showing the relevance of the multisemilattice structure in the design of algorithms aimed at calculating unitary implicates and implicants in temporal logics.  ...  These techniques are based on obtaining and using implicit information that is collected in terms of unitary implicates and implicants. Thus, we require efficient algorithms to calculate them.  ...  Acknowledgements The authors wish to thank the reviewers for their helpful comments and suggested improvements.  ... 
doi:10.1023/b:amai.0000038312.77514.3c fatcat:hzujhpezhbf2ho5bp5r2w4d23m

Page 1828 of Mathematical Reviews Vol. , Issue 86e [page]

1986 Mathematical Reviews  
By using the lattice differentiation technique, for the most general case of k-valued (i.e. discrete) functions of n (k-valued) variables (with the generalized notion of prime implicant), the concept of  ...  such as his staunch and uncompromising realism, his conception cf numbers as classes of mutually bijectable sets, his reduction of arithmetic to logic, his extensionalistic trend, and his very conception  ... 

Page 5246 of Mathematical Reviews Vol. , Issue 91J [page]

1991 Mathematical Reviews  
resolution for temporal logic.  ...  For this, techniques for extending theories by new function symbols have to be adopted from classical logic.  ... 

Synthesis of low-power asynchronous circuits in a specified environment

Steven M. Nowick, Michael Theobald
1997 Proceedings of the 1997 international symposium on Low power electronics and design - ISLPED '97  
Unlike most existing synchronous algorithms, we incorporate both temporal dependence and glitch activity in our model to guide synthesis.  ...  The method includes two steps: (i) an exact algorithm for 2-level synthesis, and (ii) heuristic algorithms for multi-level synthesis.  ...  Other techniques include "precomputation", "guarded evaluation" and "gated clocking" at the logic level (see [6] ) and "voltage scaling" at the system level [4] .  ... 
doi:10.1145/263272.263291 dblp:conf/islped/NowickT97 fatcat:oep5h7562zf3do5br7fkk2n5fu

Page 4898 of Mathematical Reviews Vol. , Issue 2003g [page]

2003 Mathematical Reviews  
The completeness proof is based on the translation into Bichi automata and formally tracing the reduction of the automata. The technique seems to be applicable to other versions of temporal logic.  ...  The author studies a logic with two implicational connectives, > and =, that was first introduced by M. Spinks as a logic, as well as an algebra.  ... 

Page 2192 of Mathematical Reviews Vol. , Issue 2001D [page]

2001 Mathematical Reviews  
[Valverde, Augustin] (E-MAL-AM; Malaga) Implicates and reduction techniques for temporal logics. (English summary) Logics in artificial intelligence (Dagstuhl, 1998). Ann. Math.  ...  Summary: “Reduction strategies are introduced for the future fragment of a temporal propositional logic on linear discrete time called FNext.  ... 

An investigation of power delay trade-offs on PowerPC circuits

Qi Wang, Sarma B. K. Vrudhula, Shantanu Ganguly
1997 Proceedings of the 34th annual conference on Design automation conference - DAC '97  
Based on the experiments, we propose a general methodology for the practical application of the transformations for power optimization of CMOS logic circuits.  ...  The experimental results show that a maximum 21% average power and 27.7% peak power power reduction can be obtained with only 3% delay increase.  ...  Brain Nalle, Stephen Lim, Hector Sanchez, and Dr. Shervin Hojat of Somerset Design Center, Motorola Inc., for their help in conducting the experiments. In addition, the authors thank Dr.  ... 
doi:10.1145/266021.266190 dblp:conf/dac/WangVG97 fatcat:43dfh563mjezfds5s4ldn3r5by

A Normal Form for Linear Temporal Equilibrium Logic [chapter]

Pedro Cabalar
2010 Lecture Notes in Computer Science  
That is, logic programs constitute a normal form for the non-temporal case.  ...  This formalism provides an extension of the Answer Set semantics for logic programs to arbirary theories in the syntax of Linear Temporal Logic.  ...  This modal extension has been already used for encoding action languages [11] or for checking strong equivalence of temporal logic programs by a reduction to LTL [12] .  ... 
doi:10.1007/978-3-642-15675-5_8 fatcat:z326or3vo5h2bb67x4ymoui66i

Controlling the behaviour of functional language systems [chapter]

John Darlington, Lyndon While
1987 Lecture Notes in Computer Science  
graph reduction machine ALICE.  ...  These techniques are of particular interest when developing programs for parallel asynchronous machines such as ALICE [Cripps et al, 1987 ] that can exhibit genuinely non-deterministic evaluation (even  ...  Acknowledgements Particular thanks are due to Dov Gabbay for educating the authors in matters temporal and providing many of the insights that underlie this work.  ... 
doi:10.1007/3-540-18317-5_16 fatcat:ad3csxycmbd6tinxuycd2qn6u4

Model Reduction of Modules for State-Event Temporal Logics [chapter]

M. Lawford, J. S. Ostroff, W. M. Wonham
1996 IFIP Advances in Information and Communication Technology  
In this paper we use state-event observational equivalence to perform model reduction for a subclass of formulas of state-event linear temporal logics, with particular attention being paid to a discrete  ...  The reduction technique allows limited use of immediate operators.  ...  The implication of the above theorems is that weak state-event equivalence can be used to perform model reduction for any real-time state-event temporal logic formula provided the satisfaction relation  ... 
doi:10.1007/978-0-387-35079-0_16 fatcat:d3r7wgeg5raq5aqnznvowuhlaq

Page 2091 of Mathematical Reviews Vol. , Issue 2002C [page]

2002 Mathematical Reviews  
Encisco, Structure theorems for closed sets of implicates/implicants in temporal logic (193-207); Salem Benferhat, Didier Dubois, Henri Prade and Mary-Anne Williams, A practical approach to fusing prioritized  ...  , Equational semantics (264-283); Dominique Cansell and Dominique Mery, Abstract animator for temporal specifications: application to TLA (284-299); Daniel Weise, Static analysis of mega-programs (invited  ... 
« Previous Showing results 1 — 15 out of 63,660 results