Geometry.Net - Science: Logic Temporal


Home - Science - Logic Temporal

e99.com Bookstore

Images

Newsgroups

41-60 of 102 Back | 1 | 2 | 3 | 4 | 5 | 6 | Next 20

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Logic Temporal: more books (100)

Advances in Temporal Logic (Applied Logic Series)

6th International Workshop on Temporal Representation and Reasoning (Time '99) by Fla.) International Workshop on Temporal Representation and Reasoning (6th : 1999 : Orlando, 1999-05

Extending Temporal Logic with Omega-automata: The Automata Theoretic Techniques behind PSL Model Checking by Nir Piterman, 2010-03-09

Spatio-Temporal Interpolation and Fuzzy Logic for GIS Simulation of Rural-to-Urban Transition.(geographic information systems): An article from: Cartography and Geographic Information Science by Suzana Dragicevic, Danielle J. Marceau, 1999-04-01

Temporal Logic in Finite-State Verification: Verification, Model Checking, Finite- State Machine, Linear Temporal Logic, Requirements, Formal Methods, Formal Verification

Temporal Logic: First International Conference, Ictl '94 Bonn, Germany, July 11-14, 1994 : Proceedings (Lecture Notes in Computer Science) by Dov M. Gabbay, 1994-06

GERMAN TEMPORAL SEMANTICS (Outstanding Dissertations in Linguistics) by Nerbonne, 1985-09-01

Logics for Concurrency: Structure versus Automata

Deontic Logic in Computer Science: 10th International Conference, DEON 2010, Fiesole, Italy, July 7-9, 2010. Proceedings (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence)

Integrating Functional and Temporal Domains in Logic Design: the False Path Prob by Patrick C. and Robert K. Brayton McGeer, 1991

Time Granularities in Databases, Data Mining, and Temporal Reasoning by Claudio Bettini, Sushil Jajodia, et all 2000-08-17

Practical Formal Methods using Temporal Logic by Michael Fisher, 2010-08-16

Reasoning about the function and timing of integrated circuits with Prolog and temporal logic (Technical report. University of Cambridge. Computer Laboratory) by M. E Leeser, 1988

An introduction to the model theory of first-order predicate logic and a related temporal logic (Memorandum / Rand Corporation) by Robert Mattison, 1969

lists with details

TILCO-X, An Extension Of TILCO Temporal Logic
Index Terms formal specification language, first order logic, temporal intervallogic, verification and validation, real-time systems, temporal operators.
http://www.computer.org/proceedings/iceccs/1159/11590015abs.htm

Extractions: Seventh International Conference on Engineering of Complex Computer Systems June 11 - 13, 2001 Skövde, Sweeden p. 0015 TILCO-X, an Extension of TILCO Temporal Logic Pierfrancesco Bellini, Paolo Nesi University of Florence Index Terms- ... formal specification language, first order logic, temporal interval logic, verification and validation, real-time systems, temporal operators. The full text of iceccs is available to members of the IEEE Computer Society who have an online subscription and an web account
Temporal Logic
http://www-step.stanford.edu/tutorial/temporal-logic/temporal-logic.html
Science: Math: Logic And Foundations: Nonstandard Logics And Extensions: Tempora
temporal logic is a form of modal logic in which the modal operatorsare used to denote the truth of a statement in the future or past.
http://www.worldsearch.com/dp.lisa/en/Science/Math/Logic_and_Foundations/Nonstan

Extractions: FamilyConnect: Family Internet and E-mail Filtering Solutions Did you know ? You can boost your Internet Speed up to 200% without additional hardware Sunday, March 23, 2003 Famous Birthday: Keri Russell Search For : What: In: Web Sites Shopping Books Used Books Calendars Magazines Popular Music Classical Music Used CDs VHS DVD Used DVDs/Videos Software Video Games Used Video Games Computers Electronics Toys Baby Outdoor Living Kitchen Auto Auctions SHOP: 2003 Calendars Autos Sports Gifts ... Shopping Guide FINANCING: Credit Cards Real Estate Loans FIND: Careers Personals Find People INTERNET: Access (ISP) Free MP3 Hosting Domain Registration ... Rings COMPUTER: Software Hardware Virus Protection
Springer LINK: Formal Aspects Of Computing - Abstract Volume 12 Issue 1 (2000) P
A flexible notation for both propositional and firstorder reasoning about periods of time found in Category Science Math temporal logic Composing and Refining Dense temporal logic Specifications. Antonio Cau. Keywordstemporal logic; Compositionality; Refinement. Article in PDF format (206 KB).
http://link.springer.de/link/service/journals/00165/bibs/0012001/00120052.htm

Extractions: Received January 1997 / Accepted in revised form April 2000 Abstract. A dense temporal logic development method for the specification, refinement, composition and verification of reactive systems is introduced. A reactive system is specified by a pair consisting of a machine and a condition that indicate the valid computations of this machine. Compositionality is achieved by indicating whether each step is an environment step, a system step, or a communication step. Refinement can be expressed straightforwardly in the logic because the stutter problem is elegantly solved by using the dense structure of the logic. Compositionality enables us to break refinement between complex systems into refinement between small and simple systems. The latter can then be verified by existing proof rules for refinement which are reformulated in our formalism. Keywords: Temporal logic; Compositionality; Refinement
Citation
ACM Transactions on Programming Languages and Systems (TOPLAS) archive Volume 16, Issue 3 (May 1994) toc The temporal logic of actions Author Leslie Lamport
http://portal.acm.org/citation.cfm?id=177726&dl=ACM&coll=portal&CFID=11111111&CF
Temporal Logic
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z temporal logic. Modallogic approaches to temporal logic.
http://cd1.fisher.su.oz.au/stanford/entries/logic-temporal/
Temporal Logic
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z. temporal logic. Modallogic approaches to temporal logic.
http://www.seop.leeds.ac.uk/archives/win1999/entries/logic-temporal/

Extractions: A B C D ... Z The term Temporal Logic has been broadly used to cover all approaches to the representation of temporal information within a logical framework, and also more narrowly to refer specifically to the modal-logic type of approach introduced around 1960 by Arthur Prior under the name of Tense Logic and subsequently developed further by logicians and computer scientists. Applications of Temporal Logic include its use as a formalism for clarifying philosophical issues about time, as a framework within which to define the semantics of temporal expressions in natural language, as a language for encoding temporal knowledge in artificial intelligence, and as a tool for handling the temporal aspects of the execution of computer programs. The logical language of Tense Logic contains, in addition to the usual truth-functional operators, four modal operators with intended meanings as follows: P "It has at some time been the case that ..."
Temporal Logic In Specification 1987
dblp.unitrier.de temporal logic in Specification 1987 Altrincham, UK. 1-20;Shmuel Katz, Doron Peled Interleaving Set temporal logic.
http://www.informatik.uni-trier.de/~ley/db/conf/tls/tls1987.html

Extractions: Behnam Banieqbal Howard Barringer Amir Pnueli (Eds.): Temporal Logic in Specification, Altrinchamm UK, April 8-10, 1987, Proceedings. Lecture Notes in Computer Science 398 Springer 1989, ISBN 3-540-51803-7 DBLP Pierre Wolper : On the Relation of Programs and Computations to Models of Temporal Logic. 75-123 Zohar Manna Amir Pnueli : Specification and Verification of Concurrent Programs by forall-Automata. 124-164 Bernhard Josko : MCTL - An Extension of CTL for Modular Verification of Concurrent Systems. 165-187 Edmund M. Clarke Orna Grumberg : The Model Checking Problem for Concurrent Systems with Many Similar Processes. 188-201 Moshe Y. Vardi
International Conference On Temporal Logic 1994
Dov M. Gabbay, Hans Jürgen Ohlbach (Eds.) temporal logic, First InternationalConference, ICTL '94, Bonn, Germany, July 1114, 1994, Proceedings.
http://www.informatik.uni-trier.de/~ley/db/conf/ictl/ictl1994.html

Extractions: Dov M. Gabbay (Eds.): Temporal Logic, First International Conference, ICTL '94, Bonn, Germany, July 11-14, 1994, Proceedings. Lecture Notes in Computer Science 827 Springer 1994, ISBN 3-540-58241-X DBLP Odd Erik Hansen : Combining Temporal Specification Techniques. 1-16 Shmuel Katz : Global Equivalence Proofs for ISTL. 17-29 Jos C. M. Baeten Jan A. Bergstra Roland N. Bol : A Real Time Process Logic. 30-47 T. S. E. Maibaum : Sometimes "Tomorrow" is "Sometime" - Action Refinement in a Temporal Logic of Objects. 48-66 Anthony J. Bonner Michael Kifer : Applications of Transaction Logic to Knowledge Representation. 67-81 Patrick Doherty Witold Lukaszewicz : Cicumscribing Features and Fluents. 82-100 Silvana Badaloni Marina Berati : Dealing with Time Granularity in a Temporal Planning System. 101-116 M. Reynolds : Axiomatizing U and S over Integer Time. 117-132 Valentin Goranko : Temporal Logic with Reference Pointers. 133-148 Yde Venema : Completeness through Flatness in Two-Dimensional Temporal Logic. 149-164 Bart Vergauwen Johan Lewi I. Avau
Temporal Logics
Without the addition of additional temporal operators, temporal logic cannot expressall regular expressions. Syntax. temporal logic and the Next time operator.
http://cs.wwc.edu/~aabyan/Logic/Temporal.html

Extractions: Connections Temporal logics are designed to express temporal progression. It is customary to add the operator [] with the interpretation determined by the logic. A second operator is the dual of the first i.e. A = ¬[]¬A and []A = ¬ ¬A. Figure 1 illustrates some readings of the formulas []A and A. Temporal logic plays an important role in the specification, derivation, and verification of programs as programs may be viewed as progressing through a sequence of states, a new state after each event in the system. They have a particularly useful role in the specification and verification of communication protocols and reactive systems. Propositional temporal logics have the finite model property making them useful for the derivation of programs from formal specifications. The derived model resembles a finite state machine hovever, the model accepts infinite strings and belongs to the class of w -automata. Without the addition of additional temporal operators, temporal logic cannot express all regular expressions.
Basic Temporal Logic
Basic temporal logic. Accordingly, the minimal temporal logic is axiomatizedby adding to system K the axiom (4), which corresponds to transitivity.
http://www.informatik.uni-leipzig.de/~duc/Thesis/node52.html

Extractions: Next: Propositional Dynamic Logic Up: Modal logic Previous: Montague-Scott semantics Contents The reading of the operator as ``always in the future'' (and accordingly, as ``sometimes in the future'') has proved plausible for many modal logics. Those systems are the most simple temporal (or tense) logics. Semantically, the ``possible worlds'' of a Kripke model are interpreted as moments in time, and the accessibility relation is viewed as the the relation ``later than''. Clearly, not all algebraic properties that can be imposed on binary relations are meaningful under a temporal interpretation. The most interesting properties are those characterizing ordering relations. Transitivity is probably the most basic condition that can be placed on the relation ``later than'', so it is typically assumed that temporal structures are transitive. Accordingly, the minimal temporal logic is axiomatized by adding to system K the axiom , which corresponds to transitivity. That system is denoted K , with the subscript indicating that a temporal logic is being considered.
LAC - 7035
The approach is to study the use of specialised logics (linear logic, modal logic,temporal logic) for declarative implementation and reasoning about such
http://www.newcastle.research.ec.org/esp-syn/text/7035.html

Extractions: Work Area: Knowledge Engineering and Representation Keywords logic and change, reasoning about action, temporal reasoning, declarativity Start Date: 1st October 92 / Duration: 36 months / Status: running participants contact Abstract LAC focuses on the definition of declarative approaches to handle the phenomena of action and change, which arise in areas like planning, belief revision, concurrent and multiagent systems. The approach is to study the use of specialised logics (linear logic, modal logic, temporal logic) for declarative implementation and reasoning about such phenomena. Reasoning is an integral part of intelligent systems. In reality any such system has to cope with a changing world. This is certainly true for humans, but also for robots, database management systems, human/computer interfaces, programming environments, etc. Hence reasoning must account for change in order to be truly useful in practice. Logical approaches to artificial intelligence have the advantage of offering a declarative framework for the representation of knowledge. On the other hand, Classical logic, the generally assumed logical theory in AI, was originally conceived for the static world of mathematics, and is not well equipped to deal with the notions of action and change, which are often crucial in the problems that AI is meant to address. Many of the criticisms against the "logicist" view of AI find one of their main motivations in this inadequacy to deal with change. However, recently the AI community has started to consider alternative logical theories which are better equipped to cope with the problems of change. Among such theories are modal logic, temporal logic, Girard's linear logic and Bibel's linear proofs.
Temporal Logic
temporal logic. We should mention that temporal logic is by no means theonly tool used in AI for enabling reasoning about time and change.
http://www.rpi.edu/~brings/LOG AI/lai/node8.html
CS 557 References On Temporal Logic
Session 18 4 October 1995. Some references for temporal logic. Hailpern, Brent T.,Verifying Concurrent Processes Using temporal logic , SpringerVerlag (1981).
http://www.cs.colostate.edu/~cs557/read/temporal.html

Extractions: Computer Science Department Hailpern, Brent T., Verifying Concurrent Processes Using Temporal Logic , Springer-Verlag (1981). Lamport, Leslie, " Sometime is sometimes not never 7th POPL, , ACM (1980). Lamport, Leslie, "TIMESETS: A New Method for Temporal Reasoning About Programs," Logics of Programs , D. Kozen, ed., LNCS #131, Springer-Verlag (1982). Manna, Zohar and Pnueli, Amir, "Verification of Concurrent Programs: A Temporal Proof System," Department of Computer Science, Stanford University (Jun 1983), Report No. STAN-CS-83-967. Moszkowski, Executing Temporal Logic Programs , Cambridge University Press (1986). Pnueli, Amir, "The Temporal Logic of Programs," 18th Annual Symposium on Foundations of Computer Science , IEEE (1977). This is the classic reference. Pnueli, Amir, "The Temporal Semantics of Concurrent Processes," Proc. of the International Symposium on Semantics of Concurrent Computation , Springer-Verlag (1979).
KLUWER Academic Publishers | Advances In Temporal Logic
Books » Advances in temporal logic. Advances in temporal logic. Addto cart. edited by Howard Barringer University of Manchester, UK
http://www.wkap.nl/prod/b/0-7923-6149-0

Extractions: Time is a fascinating subject that has captured mankind's imagination from ancient times to the present. It has been, and continues to be studied across a wide range of disciplines, from the natural sciences to philosophy and logic. More than two decades ago, Pnueli in a seminal work showed the value of temporal logic in the specification and verification of computer programs. Today, a strong, vibrant international research community exists in the broad community of computer science and AI. This volume presents a number of articles from leading researchers containing state-of-the-art results in such areas as pure temporal/modal logic, specification and verification, temporal databases, temporal aspects in AI, tense and aspect in natural language, and temporal theorem proving. Earlier versions of some of the articles were given at the most recent International Conference on Temporal Logic, University of Manchester, UK.
KLUWER Academic Publishers | Temporal Logic
Books » temporal logic. temporal logic From Ancient Ideas to ArtificialIntelligence. Add to cart. by Peter Øhrstrøm Dept. of Communication
http://www.wkap.nl/prod/b/0-7923-3586-4

Extractions: Temporal Logic: From Ancient Ideas to Artificial Intelligence deals with the history of temporal logic as well as the crucial systematic questions within the field. The book studies the rich contributions from ancient and medieval philosophy up to the downfall of temporal logic in the Renaissance. The modern rediscovery of the subject, which is especially due to the work of A. N. Prior, is described, leading into a thorough discussion of the use of temporal logic in computer science and the understanding of natural language.
Temporal Logic & SE
temporal logic SE. Web Engineering. temporal logic SE. logic and Software Engineering,International Workshop in Honor of CS Tang, Beijing, pages 4371, 1995.
http://www.iturls.com/English/SoftwareEngineering/SE_f.asp
Temporal Logic
Definition of temporal logic, possibly with links to more informationand implementations. NIST. temporal logic. (definition).
http://www.nist.gov/dads/HTML/temporllogic.html

Extractions: (definition) Definition: A logic with a notion of time included. The formulas can express facts about past, present, and future states. The formulas are interpreted over Kripke structures, which can model computation; hence temporal logic is very useful in formal verification Author: SKS The SMV model checker. Go to the Dictionary of Algorithms and Data Structures home page. If you have suggestions, corrections, or comments, please get in touch with Paul E. Black (paul.black@nist.gov). Entry modified Sat Sep 4 16:48:17 1999.
Alur/Henzinger/Kupferman: Alternating-time Temporal Logic
Alternatingtime temporal logic. Rajeev Alur, Thomas A. Henzinger,and Orna Kupferman temporal logic comes in two varieties linear
http://www-cad.eecs.berkeley.edu/~tah/Publications/alternating-time_temporal_log

Extractions: Rajeev Alur, Thomas A. Henzinger , and Orna Kupferman Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branching-time temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general variety of temporal logic: alternating-time temporal logic offers selective quantification over those paths that are possible outcomes of games, such as the game in which the system and the environment alternate moves. While linear-time and branching-time logics are natural specification languages for closed systems, alternating-time logics are natural specification languages for open systems. For example, by preceding the temporal operator "eventually" with a selective path quantifier, we can specify that in the game between the system and the environment, the system has a strategy to reach a certain state. The problems of receptiveness, realizability, and controllability can be formulated as model-checking problems for alternating-time formulas. Depending on whether or not we admit arbitrary nesting of selective path quantifiers and temporal operators, we obtain the two alternating-time temporal logics ATL and ATL*. ATL and ATL* are interpreted over concurrent game structures Journal of the ACM 49:672-713, 2002. Preliminary versions appeared in the
Interval Temporal Logic
Interval temporal logic. Interval temporal logic (ITL) is an important class oftemporal logic which was initally devised by Ben Moskowski in the 1980's.
http://www.cs.ukc.ac.uk/people/staff/hb5/interval.html

Extractions: Interval Temporal Logic (ITL) is an important class of temporal logic which was initally devised by Ben Moskowski in the 1980's. Standard temporal logics (see e.g. this page ) are defined over infinite state models, for example, the models for Manna and Pnueli Linear Time Temporal Logic are infinite state sequences. However, in interval temporal logic the model theory is restricted to finite state sequences, called intervals (although, supporting infinite state sequences is currently being investigated). There are a number of reasons for being interested in such logics. One reason is that interval temporal logic lends itself to execution. This is apparent from Moskowski's initial work. In addition, a number of interesting and powerful operators arise naturally from ITL. In fact, it is straightforward to derive operators very like the constructs of imperative programming (e.g. assignment, conditionals, iteration etc). This then yields the possibility that abstract specifications and concrete implementations can be realised in the same notation, with refinement mappings between. An additional aspect of interval temporal logic is that it provides a very simple real-time model in which one unit of time is past when moving from state to state. Consequently, timings can be obtained by measuring interval lengths.

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

41-60 of 102 Back | 1 | 2 | 3 | 4 | 5 | 6 | Next 20