Filters








67,174 Hits in 4.4 sec

On the Feasibility of Checking Temporal Integrity Constraints

J. Chomicki, D. Niwinski
1995 Journal of computer and system sciences (Print)  
We analyze the computational feasibility of checking temporal integrity constraints formulated in some sublanguages of rst-order temporal logic.  ...  On the other hand, if no quanti ers are in the scope of a temporal operator and all the quanti ers are universal, temporal integrity checking can be done in exponential time.  ...  Acknowledgments The comments of the anonymous referees are gratefully acknowledged.  ... 
doi:10.1006/jcss.1995.1088 fatcat:mdiltylxsbfwld4gewy2rm7nji

Integrity Constraints for Probabilistic Spatio-Temporal Knowledgebases [chapter]

Francesco Parisi, John Grant
2014 Lecture Notes in Computer Science  
be adopted to address the consistency checking problem The converse of the theorem above does not hold Example enough to represent additional knowledge concerning constraints on the movements of objects  ...  Example (Model M) Membership: deciding whether K is consistent corresponds to checking the feasibility of Membership: deciding whether K is consistent corresponds to checking the feasibility of Membership  ...  data The knowledge is represented as spatio-temporal atoms describing the location of objects in time with a probability interval spatio-temporal denial formulas describing the integrity constraints the  ... 
doi:10.1007/978-3-319-11508-5_21 fatcat:mao6i37vgra5ne6mrjcsf4zhha

Hyper Temporal Networks [article]

Carlo Comin, Roberto Posenato, Romeo Rizzi
2017 arXiv   pre-print
in the consistency check of the instances.  ...  On one side, there exist practical pseudo-polynomial time algorithms for checking consistency and computing feasible schedules for HyTNs.  ...  Examples of possible quantitative temporal aspects are: constraints on the earliest start time and latest end time of activities, constraints over the minimum and maximum temporal distance between activities  ... 
arXiv:1503.03974v3 fatcat:xyubhuy3u5hs3ce5aogkkforaq

Temporal Integrity Constraints [chapter]

Jef Wijsen
2016 Encyclopedia of Database Systems  
Since the late eighties, progress has been made in the problem of checking temporal integrity [9, 2, 11] without having to store the entire database history.  ...  HISTORICAL BACKGROUND The use of first-order temporal logic for expressing temporal integrity constraints dates back to the early eighties (see for example [7] ).  ...  This entry focuses on temporal integrity of databases that use (temporal extensions of) the relational data model.  ... 
doi:10.1007/978-1-4899-7993-3_400-2 fatcat:6trxo4lqk5aqbltxkg3jomyql4

Temporal Integrity Constraints [chapter]

Hans Hinterberger, Josep Domingo-Ferrer, Vipul Kashyap, Vijay Khatri, Richard T. Snodgrass, Paolo Terenziani, Manolis Koubarakis, Yue Zhang, James B. D. Joshi, Johann Gamper, Michael Böhlen, Christian S. Jensen (+145 others)
2009 Encyclopedia of Database Systems  
Since the late eighties, progress has been made in the problem of checking temporal integrity [9, 2, 11] without having to store the entire database history.  ...  HISTORICAL BACKGROUND The use of first-order temporal logic for expressing temporal integrity constraints dates back to the early eighties (see for example [7] ).  ...  This entry focuses on temporal integrity of databases that use (temporal extensions of) the relational data model.  ... 
doi:10.1007/978-0-387-39940-9_400 fatcat:sfrzk2obmbf7lmtiz2saetuvhu

Integrating planning and scheduling

A. Garrido, F. Barber
2001 Applied Artificial Intelligence  
The integrated system has the advantage of obtaining a ...nal plan which is executable and optimal.  ...  In this paper, an intuitive way of integrating independent planning and scheduling processes is presented which achieves better performance in the process of solving planning and scheduling problems.  ...  This way, the plan obtained by the planner must be instantiated in time. The scheduler checks the feasibility of each entire plan (with the overload that it supposes).  ... 
doi:10.1080/088395101300125734 fatcat:he53e7c36ffuvilnacgfetanbi

Scheduling in a Planning Environment

Antonio Garrido Tejero, Miguel A. Salido, Federico Barber
2000 Planen und Konfigurieren  
In a real planning problem, there exists a set of constraints (both temporal constraints and resource usage constraints) which must be satisfied in order to obtain a feasible plan.  ...  Hence, both specific planning and scheduling optimisation criteria are used in order to improve the behaviour of the integrated system, its efficiency and the quality of the obtained plan.  ...  ACKNOWLEDGEMENTS This work is proposed in the Intelligent Planning & Scheduling Group of the Polytechnic University of Valencia (http://www.dsic.upv.es/users/ia/gps) and partially supported by the grant  ... 
dblp:conf/puk/GarridoSB00 fatcat:yxi34vpp3rdljdwxthv6fgj7ae

Dynamic integrity constraints definition and enforcement in databases: a classification framework [chapter]

M. A. Pacheco Silva
1997 Integrity and Internal Control in Information Systems  
A dynamic constraint expresses conditions that involve facts of two or more states of the database.  ...  Since the database is expected to satisfy such conditions, a fundamental issue about integrity constraints is their enforcement. Many methods have been developed in this respect.  ...  The author is supported by a scholarship from CAPES (MEClBrazil).  ... 
doi:10.1007/978-0-387-35317-3_4 fatcat:gyyz3ehp2bfghfmlodgdf6eebq

Page 5580 of Mathematical Reviews Vol. , Issue 96i [page]

1996 Mathematical Reviews  
Summary: “We analyze the computational feasibility of checking temporal integrity constraints formulated in some sublanguages of first-order temporal logic.  ...  96i:68017 68 COMPUTER SCIENCE 5580 96i:68017 68P15 03B45 03D05 03D15 68Q25 Chomicki, Jan (1-KSS-IS; Manhattan, KS); Niwinski, Damian (PL-WASW; Warsaw) On the feasibility of checking temporal integrity  ... 

On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier

Carlo Comin, Romeo Rizzi, Michael Wagner
2018 International Symposium/Workshop on Temporal Representation and Reasoning  
An RDTP comes with a finite set of temporal variables, and a finite set of temporal constraints each of which can be either one of the following three types: (t 1 ) two-variable linear-difference simple  ...  Kumar studied the Restricted Disjunctive Temporal Problem (RDTP), a restricted but very expressive class of Disjunctive Temporal Problems (DTPs).  ...  ., one can check any one of the two models in f (m, n, W )-time whenever there's an f (m, n, W )-time procedure for checking the consistency of the other one.  ... 
doi:10.4230/lipics.time.2018.10 dblp:conf/time/CominR18 fatcat:bltytvsov5e63hqgj7iokzpv34

Checking the Consistency of Combined Qualitative Constraint Networks

Quentin Cohen-Solal, Maroua Bouzid, Alexandre Niveau
2017 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We study the problem of consistency checking for constraint networks over combined qualitative formalisms.  ...  We propose a framework which encompasses loose integrations and a form of spatio-temporal reasoning.  ...  Moreover, in each case, constraints in one network of the tuple can entail constraints between the same variables in the other networks.  ... 
doi:10.1609/aaai.v31i1.10692 fatcat:tn655bmfnbek7frstx25eoyazi

Physics-based Motion Planning with Temporal Logic Specifications [article]

Muhayyuddin, Aliakbar Akbari, Jan Rosell
2017 arXiv   pre-print
In this line, some recent approaches describe tasks with Linear Temporal Logic (LTL) and reason on discrete actions to guide sampling-based motion planning, with the aim of finding dynamically-feasible  ...  the purposeful manipulation of objects, on the other hand.  ...  On other hand, it is evolving towards the integration with task planning, like the LTL-based approaches that define multiple goal tasks in terms of temporal logic, such as visit region A followed by region  ... 
arXiv:1710.00419v1 fatcat:6tnjeapzbjdh3frqcgpptirmci

Alternating Minimization Based Trajectory Generation for Quadrotor Aggressive Flight [article]

Zhepei Wang, Xin Zhou, Chao Xu, Jian Chu, Fei Gao
2020 arXiv   pre-print
Moreover, based on polynomial theory, an extremely fast feasibility check method is designed for various kinds of constraints.  ...  By incorporating the method into our alternating structure, a constrained minimization algorithm is constructed to optimize trajectories on the premise of feasibility.  ...  Temporal scaling is applied on the solution until dynamical feasibility is achieved.  ... 
arXiv:2002.10629v1 fatcat:gtywbqrgoff7tbe7mm666vt32e

Physics-based Motion Planning with Temporal Logic Specifications

Muhayyuddin, Aliakbar Akbari, Jan Rosell
2017 IFAC-PapersOnLine  
In this line, some recent approaches describe tasks with Linear Temporal Logic (LTL) and reason on discrete actions to guide samplingbased motion planning, with the aim of finding dynamically-feasible  ...  the purposeful manipulation of objects, on the other hand.  ...  On the other hand, it is evolving towards the integration with task planning, like the LTL-based approaches that define multiple goal tasks in terms of temporal logic, such as visit region A followed by  ... 
doi:10.1016/j.ifacol.2017.08.1578 fatcat:ddsa6i3e4jb7hbgz45yj6zvbze

Levels of Integration between Low-Level Reasoning and Task Planning [article]

Esra Erdem, Volkan Patoglu, Peter Schüller
2013 arXiv   pre-print
feasibility.  ...  We analyze the usefulness of levels of integration in these domains, both from the point of view of computational efficiency (in time and space) and from the point of view of plan quality relative to its  ...  Based on the number of low-level checks, precomputation for Legged Locomotion seems feasible for only one of the two low-level modules (L leg ), while for Robotic Manipulation we can apply precomputation  ... 
arXiv:1307.7461v1 fatcat:i64wnil5wvailbgc3r4ko2t4r4
« Previous Showing results 1 — 15 out of 67,174 results