Geometry.Net - Science: Logic Temporal

Starlog At Waikato Department Of Computer Science
Declarative temporal logic programming language for general purpose programming, simulation, modeling reactive systems. Starlog programs consist of 2 components a set of timed facts, a set of temporal logic rules. Somewhat like Prolog.
http://www.cs.waikato.ac.nz/Research/starlog/index.html

Extractions: Search Home People Research ... Facilities John Cleary Roger Clayton Bernhard Pfahringer Mark Utting Starlog is a declarative temporal logic programming language for general purpose programming, for simulation, and for modelling reactive systems. A Starlog program consists of two components: a set of timed facts describing a history of the Starlog world up to this point, and a set of temporal logic rules describing how to compute a new state of the world from facts true in the previous and current states of the world. For example, here are some rules that compute prime numbers. When this program is executed, the rules generate facts like prime@2, prime@3, mult@4, prime@5, and so on. prime@N = 2, not(mult@N). mult@I*J = I. Starlog repeatedly applies the program rules to the current history of the world, thereby generating a new history of the world, which gets fed back into the next iteration of the loop. The history of the world includes facts corresponding to I/O operations and to the values of program variables of conventional programming languages. As a result, Starlog programs have a natural, declarative specification of I/O and destructive update.
Temporal Logic
Automatic verification of protocols and Reactive systems using temporallogic. temporal logic Time is of the Essence. temporal logic.
http://www.time-rover.com/tl.html
Temporal Logic
Automatic verification of protocols and Reactive systems using temporal logic.temporal logic Time is of the Essence. Safety properties in temporal logic.
http://www.time-rover.com/ltl.html

Extractions: Temporal Logic: Time is of the Essence Temporal logic is an extension of conventional (propositional) logic which incorporates special operators that cater for time. With Temporal Logic one can specify (and verify, using the TemporalRover) how components, protocols, objects, modules, procedures and functions behave as time progresses. The specification is done with (Temporal) logic statements that make assertions about properties and relationships in the past, present, and the future. Temporal Logic has been used extensively in award winning verification projects, such as done by the 1996 Turing award winner, Prof. Amir Pnueli. Temporal Logic is especially effective for the specification of Reactive (sub)systems and protocols , where indeed Time is of the Essence The TemporalRover allows designers, programmers, and testers to expand their existing design/programming language to support Temporal-Logic. The TemporalRover will translate those Temporal-Logic statements into executable code in the language being used.
Homepage Of Joeri Engelfriet
Vrije Universiteit Amsterdam Formal models for static and dynamic aspects of complex reasoning processes, temporal logic, and belief revision.
http://www.cs.vu.nl/~joeri/
Martin Fränzle, Researcher In CS, Oldenburg University, Germany
Universit¤t Oldenburg Formal methods, real-time and hybrid systems, hardware synthesis and verification, and temporal logic.
http://ca.informatik.uni-oldenburg.de/~fraenzle/

Extractions: Dr. Position: Till July 2002, I have been senior research assistant at the Computer Science Department of the , Germany. In August 2002, I have moved to the Technical University of Denmark as an associate professor. Please consult my new homepage for more recent information. Research interests: Temporal logic: Semantic models of embedded systems and VLSI New address: Informatics and Mathematical Modelling
Re: Marking Up Temporal Logic
PrevNextIndexThread Re Marking up temporal logic. Warren, What operatorsdo you need? I am unfamiliar with first order temporal logic.
http://lists.w3.org/Archives/Public/www-math/msg00499.html

Extractions: [Prev] [Next] [Index] [Thread] http://www.webeq.com , and make your images. (Unless temporal logic uses unusual operators...) Also, Mathematica 3.0 and higher can be used as high-quality equation editor to make GIFs if you have it available to you. Back in the TeX world, there is the venerable LaTeX2HTML program, but unless you have it installed and are familiar with it, it is definitely not a *quick* way of making a couple of equation images. another interesting alternative if you want to stick with TeX, but don't want to mess with images or a mess of software installation, is TeX2HTML, which uses a combination of HTML hacks and symbol fonts to fake equations in pure HTML. It usually turns out pretty well, and you can try it free for 21 days. I think you can even send in your HTML files with embedded TeX by email and get your processed files back by email. The URL is http://www.tex2html.com
Shmuel Katz's Home Page
The Technion Language constructs for distributed programming (superimposition, multiparty interactions, reconciliations), tools for design and programming of distributed systems (debugging, domain archetypes), interleaving set temporal logic (including for cache consistency), self-stabilization and fault-tolerance, formal specification methods.
http://www.cs.technion.ac.il/~katz/

Extractions: CS home page a photograph Department of Computer Science The Technion Haifa 32000, Israel +972-4-829-4322 (voice) +972-4-822-1128 or -829-4353 (fax) katz@cs.technion.ac.il Formal specification methods and connections among them, including issues of translations among specification notations and their effects on properties of models, Verification using convenient executions, including semi-automatic proofs built over a PVS proof environment, Language constructs for distributed programming (superimposition, multiparty interactions, reconciliations), Tools for design and programming of distributed systems(debugging, domain archetypes) Interleaving set temporal logicISTL (including for cache consistency), Self-stabilization and fault-tolerance. A list of publications For copies of most of the papers, please send me an email request. However, a postscript copy of the paper "A Mechanized proof Environment for the Convenient Computations proof Method" by Marcelo Glusman and myself, to appear in the journal Formal Methods in System Design, is available here . The article "Superimpositions and Aspect-Oriented Programming" by Marcelo Sihman and myself, to appear in the BCS Computer Journal, is available
Angelo Montanari Home Page
University of Udine logical specifications of real-time systems, temporal and object-oriented databases, deductive databases, temporal representation and reasoning, modal and temporal logic, set theory.
http://www.dimi.uniud.it/~montana/index.html

Extractions: fax: ++39 0432 55-8499 Office: Room SN14 M.Sc. in Computer Science, University of Udine, April 1987, thesis : ``A distributed architecture for natural language processing. Quantification and reference'', under the supervision of Prof. Giovanni Guida. The thesis received a prize from IBM Italia as one of the best theses in computer science of the 1987. Ph.D. in Logic and Computer Science, University of Amsterdam, September 1996, thesis: ``Metric and Layered Temporal Logic for Time Granularity'', under the supervision of Prof. Johan van Benthem, University of Amsterdam and University of Stanford, and Prof. Alberto Policriti, University of Udine. 1987-1988 : Civil Service 1989-1991 : researcher at CISE - Tecnologie Innovative, Milano, Artificial Intelligence and Software Engineering Group. During this period, he was involved in national (CNR Project on Informatic Systems and Parallel Computation) and international (ESPRIT Project n. 2409 EQUATOR: an Environment for QUAlitative and TempOral Reasoning) research projects
Simin Nadjm-Tehrani
Link¶ping University Formal methods in verification of real-time and embedded systems, including discrete and hybrid models, applications of temporal logic, symbolic model checking, automata-based decompositional proof techniques.
http://www.ida.liu.se/~snt/
Kono's Temporal Logic Related Information
The summary for this Japanese page contains characters that cannot be correctly displayed in this language/character set.
http://rananim.ie.u-ryukyu.ac.jp/~kono/temporal-logic.html

Extractions: »þ¶è´Ö»þÁêÏÀÍý(Interval Temporal Logic)¤ò»È¤¤¿¤µ¤Þ¤¶¤Þ¤Ê¥×¥í¥¸¥§¥¯¥È ¤Ë´Ø¤¹¤ë¥Ú¡¼¥¸¤Ç¤¹¡£ English Page is here Tokio-9.94 Interval Temporal Logic ¤ò»È¤¤¿¥×¥í¥°¥é¥ß¥ó¥°¥Ä¡¼¥ë Tokio Programming Language RTL-Tokio Piplelined CPU verification tool LITE Intervale Temporal Logic Verifier TEMPORAL LOGIC PROGRAMMING LANGUAGE Tokio Shinji Kono, Tatsuya Aoyagi, Masahiro Fujita, Hidehiko Tanaka, Tatsuhiko Moto-oka
DeveloperWorks: Java Technology : Diagnosing Java Code: Assertions And Temporal
One way to fill this gap is with temporal logic, a formalism used to describe howa program state will change over time. And temporal logic can be extended.
http://www-106.ibm.com/developerworks/java/library/j-diag0723.html?dwzone=java
TemporalRover
Provides automatic verification of protocols and reactive systems through temporal logic specifications.
http://www.time-rover.com/
DeveloperWorks: Java Technology : Diagnosing Java Code: Using Temporal Logic Wit
temporal logic is a formalism used to describe how a program state will changeover time. Diagnosing Java code Using temporal logic with bug patterns,
http://www-106.ibm.com/developerworks/java/library/j-diag0827.html?dwzone=java
Logic And Computation Group
Department of Computing and Mathematics, logic and Computation Group. Research projects Proof Methods for NonClassical logics; temporal and Modal logics; Programming Language Design; Agent-Based Systems. Members, research interests, bibliography.
http://www.doc.mmu.ac.uk/RESEARCH/LoCo/

Extractions: Manchester M1 5GD, U.K. C ONTACT: Michael Fisher Back row, from left: Tony Kakoudakis, Heiko Kampmann, Ullrich Hustadt, Michael Fisher. Front row, from left: Clare Dixon, Chiara Ghidini, Renate Schmidt, Marco Arranz. The Logic and Computation research group is part of the Department of Computing and Mathematics within the Manchester Metropolitan University . Its members are currently Shaheena Abbas, Marco Arranz, Alexander Bolotov, Clare Dixon, Michael Fisher, Chiara Ghidini, Ullrich Hustadt, Tony Kakoudakis, Heiko Kampmann, Adam Kellett, Peter Quigley, and Renate Schmidt. Some previous members include Rob Johnson , Marco Mulder, Bob Scott , Adam Walker, and Michael Wooldridge Shaheena Abbas is a Lecturer in the Department of Computing and Mathematics. Prior to joining the department she was a member of the Multi-Agent Systems Group within the Department of Computation at UMIST, as a student and Research Assistant and as a Research Assistant within the Department of Computer Science, University College Dublin. She holds a B.Sc. honours degree in Management Science and a degree a M.Sc. degree in Computation and will graduate with a Doctorate in Computation in 1998. She has been actively involved in research in the area of Multi-Agent Systems for the past six years and her main area of interest is Multi-Agent System Design and Development. Marco Arranz is a Visiting Research Fellow in the Department of Computing and Mathematics. His main interests are in designing a formal framework to deal with interactive processes among autonomous agents in self-interested domains. The methods developed inherently target problems involving agents that have diferent goals and that attempt to maximize their own good. He is focused on communication protocols and negotiation processes in order to get produce coordinated plans.
SRI International - Computer Science Laboratory - Ground Temporal Logic: A Logic
Publications Ground temporal logic A logic for Hardware Verification by DavidCyrluk and Paliath Narendran. Lecture Notes in Computer Science, Volume 818.
http://www.csl.sri.com/papers/cav94/

Extractions: Abstract: We present a new temporal logic, GTL, appropriate for specifying properties of hardware at the register transfer level. We argue that this logic represents an improvement over model checking for some natural hardware verification problems. We show that the validity problem for this logic is Pi 1-1 complete. We then identify a fragment of the logic that is decidable. We show that in this fragment we are still able to encode many interesting problems, including the correctness of pipelined microprocessors. BibT E X entry:
Citations: Applications Of Temporal Logic To The Specification And Verification
A. Pnueli. Applications of temporal logic to the specification andverification of reactive systems A survey of current trends.
http://citeseer.nj.nec.com/context/4422/0

Extractions: A Temporal Description Logic for Reasoning over.. - Artale, Franconi, .. (Correct) ....E t be the target one; the two cases are captured by the following formulas, respectively: E s v (E t u :E s ) E s v E t An interesting consequence of dynamic evolution is that the source is necessarily a temporary entity. DLRUS is also able to capture safety and liveness constraints A safety constraint intuitively says that nothing bad ever happens and can be captured by the formula 2 : E v ) On the other hand, liveness constraints saying that something good will happen can be expressed by existential temporal formulas: 3 : E v ) Schema evolution. We consider ....
Dept. Of AI: Alumni
University of Ulm Object-oriented approaches to formal specification and verification, formal specification and verification of reactive systems, component-based formal development of concurrent systems, and the temporal logic of Actions.
http://www.informatik.uni-ulm.de/ki/canver.html

Extractions: University of Ulm Faculty of Computer Science Dept. of Artificial Intelligence back: Staff Alumni Ercüment Canver Ercuement .Canver @icn. siemens.de joined Siemens AG, Ulm Daniela Damm damm@ifi.unizh.ch Dr. Axel Dold dold@tescom.de or axel.dold@gmx.de joined TESCOM GmbH, Ulm Andrea Hemprich hemprich@io-software.com joined IO Software, Freiburg Martin Hiller Martin.Hiller@t-systems.de joined T-Systems/Debis, Ulm Alke Martens ... alke.martens@informatik.uni-rostock.de joined Univ. of Rostock Prof. Dr. Bernhard Nebel nebel@informatik.uni-freiburg.de joined Univ. of Freiburg Stephan Pfab spf@pc-plus.de Dr. Harald ruess@csl.sri.com joined SRI International, Menlo Park, CA Dr. Jussi Rintanen rintanen@informatik.uni-freiburg.de joined Univ. of Freiburg Detlef Schwier detlef@blaxxun.de joined blaxxun interactive, München Dr. Martin Strecker Martin.Strecker@in.tum.de joined TU München Dirk Tyschler Dirk.Tyschler@gmx.net joined Bayer AG, Leverkusen Petra Tyschler Petra.Tyschler@gmx.net joined Allianz AG, Stuttgart Prof. Dr. Adelinde
Temporal Logic
As a basis for describing the genetic algorithm we will use a combination of classicalfirstorder logic, temporal logic 116 , and probabilistic logic 106
http://www.uwasa.fi/cs/publications/2NWGA/node285.html

Extractions: Next: Probabilistic Logic Up: Temporal Probabilistic Logic Previous: Temporal Probabilistic Logic As a basis for describing the genetic algorithm we will use a combination of classical first-order logic, temporal logic [ , and probabilistic logic [ As far as temporal logic is concerned, our logic is based on temporal intervals, typically denoted I . Intervals may be used in expressions in various ways, using the following operators (table Given an interval I we have the following two operations on intervals. In order to reason within our logic we need to define some basic operators, in addition to the standard first-order logic with its boolean operators (disjunction), (conjunction), (negation), (implication) and (equivalence). We also have the first order operators (existence), and (universality). Following Manna and Pnueli [ , the temporal operators in table are sufficient for our purposes.
Temporal Probabilistic Logic
next up previous contents Next temporal logic Up Time in GeneticAlgorithms Previous Introduction. temporal Probabilistic logic.
http://www.uwasa.fi/cs/publications/2NWGA/node284.html
Temporal Annotated Constraint Logic Programming With Multiple Theories
Index Terms constraint logic programming, meta-logic, temporal reasoning, knowledgerepresentation Copyright (c) 1998 Institute of Electrical and Electronics
http://www.computer.org/conferen/proceed/dexa/0281/02810501abs.htm

Extractions: September 01 - 03, 1999 Florence, Italy p. 501 Temporal Annotated Constraint Logic Programming with Multiple Theories Paolo Mancarella, Alessandra Raffaetà, Franco Turini Università di Pisa ... constraint logic programming, meta-logic, temporal reasoning, knowledge representation The full text of dexa is available to members of the IEEE Computer Society who have an online subscription and an web account

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

21-40 of 102 Back | 1 | 2 | 3 | 4 | 5 | 6 | Next 20