41. Interval Temporal Logic Interval temporal logic (ITL) is an important class of temporal logic which was initally devised by Ben Moskowski in the 1980 s. http://www.cs.kent.ac.uk/people/staff/hb5/interval.html

Interval Temporal Logic Howard Bowman and Simon Thompson 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.

42. PhD Programme Logic In Computer Science logical foundations, lambdacalculus, equational logic, temporal logic, model checking, logic-based knowledge-representation, minimal implication, http://www.mathematik.uni-muenchen.de/~gkli/welcome_e.html

Graduiertenkolleg Logik in der Informatik Intro Announcements Colloquium Teachings ... Links

43. Dmoz : Science : Math : Logic And Foundations : Nonstandard Logics And Extension Interval temporal logic A flexible notation for both propositional and A case study applying temporal logic to specify the operation of a bank of http://weec.ovl.ru/dmoz/index.php?c=Science/Math/Logic_and_Foundations/Nonstanda

44. Nottingham FOP Meetings The modal mucalculus offers a rich logic for expressing temporal properties of processes, and much effort has gone into developing techniques for http://www.cs.nott.ac.uk/Research/fop/meetings01.html

Foundations of Programming Meetings School of Computer Science and IT University of Nottingham Speakers Abstracts Further Information The Foundations of Programming group holds regular research meetings. The meetings last around an hour, and are intended to be a friendly forum for discussion and exchange of ideas. Most meetings take the form of a talk by a group member or an invited speaker, but we also have various kinds of discussion sessions. The meetings are open to everyone, not just members of the group. Please contact Graham Hutton if you are interested in visiting the group and giving a talk. Details of previous years meetings are also available: Details of recent and upcoming meetings are given below. Speakers 2001 Friday the 14th of December, Joel Wright , University of Nottingham. Concurrent Haskell Friday 23rd of November, Louise Dennis , University of Nottingham. Proof Planning and the Lclam Proof Planner Friday 26 October, Pablo Nogueira , University of Nottingham. Understanding universal functions for the pure lambda calculus. Friday 19 October, Alex Simpson , Division of Informatics, University of Edinburgh.

45. Profile Discrete Event System, Distributed Intelligence Systems, Intelligent Agents, Reasoning Under Uncertainty, Spatial logic, temporal logic, V V of Knowledge http://myprofile.cos.com/szaidi

Dr. Abbas K. Zaidi powered by COS Expertise George Mason University School of Information Technology and Engineering Electrical and Computer Engineering System Architectures Lab Research Associate Professor Appointed: 2003 George Mason University School of Information Technology and Engineering Center of Excellence in C3I System Architectures Lab Affiliate Associate Professor Appointed: 1998 Mailing Address MSN 1G5, Science and Technology II George Mason University 4400 University Drive Fairfax, Virginia 22030 United States Contact Information Phone: (703) 993-1774 Fax: (703) 993-1601 szaidi@ieee.org http://viking.gmu.edu Qualifications Ph.D., George Mason University, Information Technology and Engineering, 1994. M.S., George Mason University, Electrical and Computer Engineering, 1991. B.E., N. E. D. University of Engineering and Technology, Electrical Engineering, 1989. Expertise and Research Interests System Architectures Discrete Event Systems Validation and Verification of Systems Model Checking Architectures Temporal and Spatial Logics Constraint Programming Temporal Planning Intelligent Agents Colored Petri Nets Other Expertise Helped develop a temporal reasoning and planning tool, called TEMPER, that implements Point Interval Logic and accompanying algorithms for solving verification, satisfiability, and inference mechanisms.

46. Method And System For Data Fusion Using Spatial And Temporal Diversity Between S Spatial and temporal fusion methods may be used to generate a combined . show the fused Pcc performance using minimum (fuzzy logic) temporal fusion. http://www.wikipatents.com/6909997.html

Create Free Account US Patent Applications License or Sell Your Patent WikiPatents Marketplace Username: Password: US Patent # (ex: 7012345) US App # (ex: 20050123456) Advanced Search var sc_project=1810540; var sc_invisible=1; var sc_partition=13; var sc_security="26fcf364"; Method and system for data fusion using spatial and temporal diversity between sensors addthis_url = location.href; addthis_title = document.title; addthis_pub = 'wikipatents'; Get related patents on CD United States Patent Link to this page http://www.wikipatents.com/6909997.html Inventor(s) Chen; Hai-Wen (Orlando, FL); Olson; Teresa L. (Winter Garden, FL) Abstract Title Information Plain text PDF images Print Summary ... Custom Search Inventor Chen; Hai-Wen (Orlando, FL); Olson; Teresa L. (Winter Garden, FL) Owner/Assignee Lockheed Martin Corporation (Orlando, FL) Patent assignment All assignments Company News Publication Date June 21, 2005 Application Number PAIR File History Application Data Transaction History ... Litigation Filing Date March 25, 2003

47. Winter School, ISI Calcutta, January, 1997. Over the past two decades, temporal logic has become a very basic tool for specifying properties of reactive systems. For finitestate systems, http://www.cmi.ac.in/~madhavan/papers/isical97.html

Madhavan Mukund Tutorial talk, Winter School on Logic and Computer Science, Indian Statistical Institute, Calcutta, January 1997. Abstract Available as gzipped dvi (35 KB) , gzipped Postscript (79 KB) and PDF Back to Madhavan Mukund's home page

48. SearchingWeb Metasearch Directory A case study applying temporal logic to specify the operation of a bank of identical elevators servicing a number of floors in a building. http://www.searchingweb.com/cgi-bin/directory/searchingweb.cgi?/Science/Math/Log

49. (S. De Amo, M. Alves) Incremental Maintenance Of Data Warehouses Based On Past T Incremental Maintenance of Data Warehouses Based on Past temporal logic Operators. Sandra de Amo (Universidade Federal de Uberlandia, Brazil) http://www.jucs.org/jucs_10_9/incremental_maintenance_of_data

top.name="UJSeries_Window"; Search Subscription Submission Procedure Login User: anonymous Special Issues Volume 13 (2007) Volume 12 (2006) Volume 11 (2005) ... Issue 9 available in: PDF (252 kB) PS (199 kB) get: Similar Docs BibTeX Read comments Write a comment get: Links into Future Incremental Maintenance of Data Warehouses Based on Past Temporal Logic Operators Sandra de Amo (Universidade Federal de Uberlandia, Brazil) M­rian Halfeld Ferrari Alves (Universit© Fran§ois Rabelais LI/Antenne de Blois, France) Abstract: We see a temporal data warehouse as a set of temporal views defined in the past fragment of the temporal relational algebra extended with set-valued attributes and aggregation. This paper proposes an incremental maintenance method for temporal views that allows improvements over the re-computation from scratch. We introduce a formalism for temporal data warehouse specification that summarizes information needed for its incremental maintenance. According to this formalism, a temporal data warehouse W is a pair of two sets of views : the materialized component and the virtual component . The materialized component of W represents the set of views physically stored in the warehouse. The virtual component of

50. Untitled -- Weizmann, Rehovot, Israel Research interests Pnueli is mainly known for the introduction of temporal logic into Computer Science ; the identification of the class of Reactive http://www-verimag.imag.fr/VHS/proposal/main_38.html

Go backward to LAG, INPG, Grenoble Go up to Appendix: The Proposers Go forward to CWI, Amsterdam, Netherlands Weizmann, Rehovot, Israel The Weizmann Institute is a research Institute based in Rehovot, Israel. It was founded in 1935, and includes today about 500 researchers and auxiliary scientific staff. The department of Applied Mathematics was formed in 1947 and among other achievements, introduced the first computer to Israel - the WEIZAC which was built at the Institute and completed in 1955. Today, the department has several groups which excel in theoretical computer science areas such as Cryptography, Complexity, Distributed Systems, Semantics and Logics of Programs. The main researchers in this last area are Professors Amir Pnueli and David Harel who have been engaged in the last 19 years in research on formal specification and verification of programs and systems, and developed the concepts and theories of Dynamic Logic Temporal Logic Reactive Systems , and Statecharts The group headed by A. Pnueli has been active over the years in development of methodologies and, more recently, tools for the deductive and combination of deductive model-checking approaches to the verification of reactive, timed, and hybrid systems. Together with O. Maler, they formulated one of the earliest models of hybrid systems . The tools developed by the group include the TLV system which combines deductive with model-checking approaches to formal verification and managed to detect bugs in the Futurebus

51. Temporal Logic This lecture gives a basic account of temporal logic from the viewpoint of computer science. Motivated by the specification of reactive and concurrent http://lat.inf.tu-dresden.de/teaching/ss2006/tl/

Temporal Logic Carsten Lutz Course Description This lecture gives a basic account of temporal logic from the viewpoint of computer science. Motivated by the specification of reactive and concurrent systems, we introduce both linear and branching-time temporal logics. We discuss the expressive power of such logics, relating them to one another, to first and second order logic, and to automata theory. We consider the two reasoning tasks model checking and satisfiability checking, and perform a detailed investigation of the computational complexity of these tasks. Prerequesites: basics of complexity theory will be helpful Organization Starting from June 12, the lecture will take place every Monday DS4 (13:00-14:00) in GRU 350 and every Thursday DS5 (14:50-16:20) in GRU 358 Lecture Material A script of the lecture is available. Credits / Examinations Computational logic students can earn 3 credits by attending this lecture. The lecture can be used for the modules SV and TCSL. In order to get the credits, CL students have to pass an oral examination at the end of the term. Literature The following literature is relevant for the lecture: E. Allen Emerson: Temporal and Modal Logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Elsevier, 1990.

52. Renate Schmidt: Research Broadly my research is situated in computational logic and automated reasoning. of a temporal resolution calculus for propositional lineartime logic. http://www.cs.man.ac.uk/~schmidt/research/

Research Research interests Publications Software More resources on the web ... Research projects Research interests Broadly my research is situated in computational logic and automated reasoning. My main research involves the development and theoretical analysis of reasoning methodologies and automated reasoning tools as well as applying these in areas such as artificial intelligence, knowledge representation, agent-based systems and mathematics. Specific topics of interest are: (fully) automated reasoning model generation, minimal model reasoning second-order quantifier elimination, hierarchical reasoning resolution-based proof techniques, resolution decision procedures most other styles of proof systems: tableau, sequent calculus, natural deduction, inverse method, Rasiowa-Sikorski proof systems, ... relationships between proof systems, relative complexity of proof systems, simulating proof procedures implementing theorem provers and other logical tools empirical evaluation of algorithms knowledge representation and reasoning, ontology reasoning, semantic web

53. [cs/0508129] Temporal Phylogenetic Networks And Logic Programming Subjclass logic in Computer Science; Artificial Intelligence; Programming Languages. The concept of a temporal phylogenetic network is a mathematical http://arxiv.org/abs/cs/0508129

arXiv.org cs Search or Article-id Help Advanced search All papers Titles Authors Abstracts Full text Help pages Full-text links: Download: PostScript PDF Other formats Citations CiteBase p revious n ... ext Computer Science > Logic in Computer Science Title: Temporal Phylogenetic Networks and Logic Programming Authors: Esra Erdem Vladimir Lifschitz Don Ringe (Submitted on 30 Aug 2005) Abstract: The concept of a temporal phylogenetic network is a mathematical model of evolution of a family of natural languages. It takes into account the fact that languages can trade their characteristics with each other when linguistic communities are in contact, and also that a contact is only possible when the languages are spoken at the same time. We show how computational methods of answer set programming and constraint logic programming can be used to generate plausible conjectures about contacts between prehistoric linguistic communities, and illustrate our approach by applying it to the evolutionary history of Indo-European languages. To appear in Theory and Practice of Logic Programming (TPLP).

54. Rbsla - RBSLA: Rule Based Service Level Agreements Project Rule based systems and in particular declarative logic programming (LP) qualifies such as defeasible logic, deontic logic, temporal event/action logics, http://ibis.in.tum.de/projects/rbsla/index.php

Friday, 25 January 2008 Home Main Menu Home ContractLog RBSLA RBSLM User Menu Download Documentation Translator Validator ... News Other Menu Prova Reaction RuleML RuleML Mandarax ... ITSOM Written by Adrian Paschke Thursday, 23 November 2006 RBSLA: Rule-based Service Level Agreements Rule-based Contract Representation and Management for electronic Contracts, Policies and Service Level Agreements Contact: Adrian Paschke Keywords IT Service Management (ITSM), Service Level Management (SLM), Service Level Agreements (SLA) and Policies, SLA metrics, Service-oriented Architectures (SOA), Event-driven Architectures (EDA), Contract Representation, Contract Management, SLA Monitoring, Business Rules, Knowledge Representation, Rule Engines, Artificial Intelligence, Logic, Utility Computing, On-Demand Computing, Grid Computing, Web Services, Defeasible Deontic Logic with Norm Violations and Exceptions, Logic of Norms, Conditional Obligations, Contrary-To-Duty Obligations and Defeasible Prima Facie Obligations, Event Calculus, Complex Event Processing, Interval-based Event Algebra, Defeasible Logic with Integrity Constraints and Rule Prioirties, Typed Logic with Polymorphic Order-Sorted Typed Unification, Hybrid Description Logic Programs (Heterogeneous DLP approach with Jena and Pellet) for Semantic Web Typing, Constraint LPs, Active ECA Rules and Transaction Logic, Event Condtion Action (ECA), Temporal Logic, RuleML, RBSLA, Test-driven Validation, Test Cases, Test Coverage, Integrity Constraints, Ordered Logic Programs (OLPs)

55. Invariance Under Stuttering In A Temporal Logic Without The “Until Your browser may not have a PDF reader available. Google recommends visiting our text version of this document. http://iospress.metapress.com/index/PX63W247G126171R.pdf

56. Discover From Your Favorite Topic Or Web Page: Temporal Discover Linear temporal logic Wikipedia, the free encyclopedia http//en.wikipedia.org/wiki/Linear_temporal_logic (wikipedia modelchecking thesis http://www.megite.com/tag/temporal

Enter a topic or web address, discover more related. All Bookmarks Log In Register Submit Your Site ... r From Enter your search terms Submit search form Web www.megite.com About Us Megite Discover is a crowdsourcing service for web browsing provided by , a leading social news aggregator. Discover From Related Topics ai antispam architecture cep ... visualization Discovered Pages D i s c ... spamfree24.org - your personal spamkiller disposable email, temporary inbox http://spamfree24.org/ email tools temporal spam B o o k m a r k D i s c ... Temporal Database Management http://www.cs.aau.dk/~csj/Thesis/ research paper temporal databases B o o k m a r k D i s c ... Temporal Intervals http://home.pacific.net.au/~lcarroli/text/temporal.htm installation bioart newmedia interactive B o o k m a r k D i s c ... Sleep enforces the temporal sequence in memory http://www.eurekalert.org/pub_releases/2007-04/plos-set041707.php memory science temporal time B o o k m a r k D i s c ... Temporal Patterns http://www.martinfowler.com/eaaDev/timeNarrative.html patterns design architecture programming B o o k m a r k D i s c ... Spaml disposable email http://www.spaml.com/ tools email temporal mail B o o k m a r k D i s c ... OLIVE: Temporal http://www.otal.umd.edu/Olive/Temporal.html

57. Online Publications: Doron Peled Girish Bhat, Doron Peled Adding Partial Orders to Linear temporal logic. . Shmuel Katz, Doron Peled Interleaving Set temporal logic (Preliminary http://www.dcs.warwick.ac.uk/~doron/dblp.html

Online Publications: Doron Peled Comments: All files are given in postscript. Files provided are latest versions available in postscript. Actual journal or conference version may have additional updates (e.g., due to galley proofs). If a journal version is provided, conference version is not found here. EE Peter Niebert, Doron Peled: Efficient Model Checking for LTL with Partial Order Snapshots. TACAS 2006: 272-286 Doron Peled, Yih-Kuen Tsay: Automated Technology for Verification and Analysis, Third International Symposium, ATVA 2005, Taipei, Taiwan, October 4-7, 2005, Proceedings Springer 2005 EE Marcin Jurdzinski, Doron Peled, Hongyang Qu: Calculating Probabilities of Real-Time Test Cases. FATES 2005: 134-151 Doron Peled, Automatic Test Generation and Monitoring of Infinite States Systems. VISSAS 2005, Timisoara, Romania, March 1722, 2005, Proceedings, IOS Press. EE Doron Peled, Hongyang Qu: Time Unbalanced Partial Order. FATES 2005: 152-169 EE Saddek Bensalem, Doron Peled, Hongyang Qu, Stavros Tripakis: Generating Path Conditions for Timed Systems.

58. A Logical Reconstruction Of Temporal Databases -- Finger 10 (6): 847 -- Journal In this work, a temporal logic framework is proposed to simultaneously cope with both the static and the dynamic aspects of temporal data. http://logcom.oxfordjournals.org/cgi/content/abstract/10/6/847?ck=nck

59. Home.html They include the logic of strict implication (C.I.Lewis), various modal logics, various forms of intensional logic, temporal logic, many valued logic, http://www.redsuspenders.com/~kyburg/new219/

DEVIANT LOGIC PHL/CSC 219/419 Henry E. Kyburg HENRY KYBURG Fall, 2004 Tue, Thur 11:0512:20 Office Hours Tue, Thur: 10:3011:00 in Latt 520 Wed: 10:00 12:00 in CSB 720 AND BY APPOINTMENT Many people think of logic as cut and dried and settled, and so it is if you think only of the classical first order logic that was essentially given by Russell and Whitehead. But unless one takes a very parochial view of logic, there are many alternatives, which I am grouping under the title of "deviant logic". They include the logic of strict implication (C.I.Lewis), various modal logics, various forms of intensional logic, temporal logic, many valued logic, probabilistic logic, nonmonotonic logic, deontic logic, and within mathematics itself, intuitionistic logic. One of the more recent variants is paraconsistent logic, which comes in a variety of forms, and allows us to treat inconsistent sets of premises sensibly. Each of these logics has a rational and a purpose, and many of them are closely related. To explore them, even in the reltively superficial way that is open to us, will give some idea of the power and generality of the logical way of doing things.

60. CJO - Abstract - Your browser may not have a PDF reader available. Google recommends visiting our text version of this document. http://journals.cambridge.org/production/action/cjoGetFulltext?fulltextid=71147

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

Page 3     41-60 of 61    Back | 1  | 2  | 3  | 4  | Next 20