Extractions: Department of Computing, Imperial College of Science, Technology and Medicine, London Series: Oxford logic guides , Vol. 28 - Oxford Science Publications Publisher : Oxford University Press - Clarendon Press , Oxford Bibliographic : DESCRIPTION : This long awaited book gives a thorough account of the mathematical foundations of temporal logic, one of the most important logic areas in computer science. It gives a solid introduction to semantical and axiomatic approaches to temporal logic, and covers the central topics of predicate temporal logic, metalanguages, general theories of axiomatization, many dimensional systems, propositional quantifiers, expressive power, Henkin dimension, temporalization of other logics, and decidability results. Much of the research presented here is at the cutting edge, both in new results and in the unifying methodology. CONTENTS : The handling of time: introduction and survey Semantical presentation of temporal connectives Axiomatic presentation of propositional temporal connectives Predicate temporal logics Temporal logics presented in the predicate calculus: language-metalanguage
CiteULike: Tag Temporal-logic [39 Articles] posted to chuspace computability-logic dynamical-system dynamics interactivity neural-symbolic temporal temporal-concept-analysis temporal-logic by http://www.citeulike.org/tag/temporal-logic
Extractions: Register Log in FAQ Recent papers classified by the tag temporal-logic. Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers (19 July 2002) by Leslie Lamport posted to formal-methods temporal-logic by tautologico on 2005-09-06 20:45:59 as along with 1 person ljcamargos Extending JML Specifications with Temporal Logic Vol. 2422/2002 (September 2002), 334. by K Trentelman , M Huisman posted to temporal-logic softnet jml java ... design-by-contract by sjgaller on 2007-06-05 07:25:21 as along with 1 person and 2 groups pdagarwal Context-driven-testers Desgin-by-Contract ... JAG : J ML A nnotation G eneration for Verifying Temporal Properties Fundamental Approaches to Software Engineering (2006), pp. 373-376. by Alain Giorgetti , Julien Groslambert posted to temporal-logic specification-generation specification softnet ... java by sjgaller on 2007-09-11 07:17:02 as along with 2 groups Context-driven-testers Desgin-by-Contract Specification-based Testing of Reactive Software: Tools and Experiments (Experience Report) (1997), pp. 525-535. by Lalita J Jagadeesan , Adam A Porter , Carlos Puchol , Christopher J Ramming , Lawrence G Votta posted to finite-state-machine test-case-generation temporal-logic softnet ... formalization by sjgaller on 2007-06-06 13:15:50 as along with 2 groups Context-driven-testers Desgin-by-Contract JML-based verification of liveness properties on a class in isolation (2006), pp. 41-48.
Temporal Prepositions And Their Logic Extended Abstract Your browser may not have a PDF reader available. Google recommends visiting our text version of this document. http://csdl.computer.org/comp/proceedings/time/2004/2155/00/21550007.pdf
Extractions: LGTCM Soft Lab Logic Programming with Temporal Constraint Graphs Presented by Sergei Bogomolov LGTCM Soft Lab The aim of this paper is to present an approach based on conception of constraint logic programming. Temporal constraints are concerned that lie in the class of closed linear inequalities involving no more than two temporal variables. This restriction allows to propose effective procedure of computation of answer to temporal constraints query. The temporal reasoning scheme combines the temporal constraints consistency procedure based on transitive closure and non-deterministic choice procedure based on SLD-resolution. The consistency procedure allows to cut off non-promise ways of search. The size of search space is cut down much more large if there are more accurate temporal constraints in initial query and rules from temporal constraint logic program. The logic programs with temporal constraints (TC) enable to use new flexible computation strategies based on analysis of accuracy of temporal constraints of TC-rules and TC-query. The computation strategy defines an order of round of search tree and includes a selection step of active atom from current query and a suitable rule choice from admissible rule list. For selection of suitable rule a more compound strategy may use the ordering of admissible rules set based on analysis of accuracy of temporal constraints.
Index Of /spec-patterns DIR Parent Directory TXT FAQ.html 04-Dec-2003 1421 295 FAQ.html.old 04-Dec-2003 1409 6.1K DIR GIL/ 02-Dec-1998 1349 - TXT http://santos.cis.ksu.edu/spec-patterns/