21,220 Hits in 5.5 sec

On the Descriptive Complexity of Temporal Constraint Satisfaction Problems [article]

Manuel Bodirsky, Jakub Rydval
2021 arXiv   pre-print
Finite-domain constraint satisfaction problems are either solvable by Datalog, or not even expressible in fixed-point logic with counting.  ...  Our main result is a complete classification of temporal CSPs that can be expressed in one of the following logical formalisms: Datalog, fixed-point logic (with or without counting), or fixed-point logic  ...  Acknowledgments We thank Wied Pakusa for the idea how to use the multipedes construction in our context.  ... 
arXiv:2002.09451v7 fatcat:4tub2atzkbcethivclgn3ajm4m

Page 3887 of Mathematical Reviews Vol. , Issue 98F [page]

1998 Mathematical Reviews  
Finding solutions to a constraint satisfaction problem is known to be an NP-complete problem in general, but may be tractable in cases where the form of allowed constraints is restricted.  ...  Summary: “Many practical combinatorial search problems may be expressed as constraint satisfaction problems, in which values must be assigned to a set of variables subject to a given set of constraints  ... 

Page 5701 of Mathematical Reviews Vol. , Issue 93j [page]

1993 Mathematical Reviews  
AE logic relies on a fixed point definition that has two significant parts. The first part is a set of assumptions or hypothe- ses about the contents of the fixed point.  ...  Reasoning tasks in this unified framework are formulated as constraint satisfaction problems, and are solved by traditional constraint satisfaction techniques, such as backtracking and path consistency  ... 

From Model-Checking to Temporal Logic Constraint Solving [chapter]

François Fages, Aurélien Rizk
2009 Lecture Notes in Computer Science  
In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some domain D, and by computing a validity  ...  This allows us to define a continuous degree of satisfaction for a temporal logic formula in a given structure, opening up the field of model-checking to optimization.  ...  of the system formalized in temporal logic with numerical constraints.  ... 
doi:10.1007/978-3-642-04244-7_26 fatcat:woxsmrefkja4fn7grsp2h32ny4

Temporal Logic in Information Systems [chapter]

Jan Chomicki, David Toman
1998 Logics for Databases and Information Systems  
In this chapter, we survey the fundamental varieties of temporal logic and describe their applications in information systems.  ...  Temporal logic is obtained by adding temporal connectives to a logic language. Explicit references to time are hidden inside the temporal connectives.  ...  For a fixed set of constraints, 28 Temporal Logic in Information Systems the number of auxiliary relations is fixed and their size is polynomial in the cardinality of the active domain of the current  ... 
doi:10.1007/978-1-4615-5643-5_3 fatcat:bmtv3r7w2bbtfldaxefnqmsbou

Monitoring Temporal Logic with Clock Variables [chapter]

Adrián Elgyütt, Thomas Ferrère, Thomas A. Henzinger
2018 Lecture Notes in Computer Science  
We solve the offline monitoring problem for timed propositional temporal logic (TPTL), interpreted over dense-time Boolean signals.  ...  The variant of TPTL we consider extends linear temporal logic (LTL) with clock variables and reset quantifiers, providing a mechanism to specify real-time constraints.  ...  Acknowledgements This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award).  ... 
doi:10.1007/978-3-030-00151-3_4 fatcat:erl37zaqznfmlbkvzwgzsp4vsq

Handling soft constraints in hoist scheduling problems: the fuzzy approach

Hélène Fargier, Jacques Lamothe
2001 Engineering applications of artificial intelligence  
When temporal bou nds are requ ired, an implicit relaxation of these flexible constraints can thu s be performed so as to meet the due-date.  ...  In HSP, the gradual effect of soaking times (operation duration in tanks) on the quality of treatment can be represented by means of fuzzy sets: the satisfaction degree in a fuzzy interval models a quality  ...  Fuzzy HSP with temporal constraints When temporal bounds exist, temporal constraints (6b) are required in addition to constraints (1)-(4); the admissibility Sat degree of the fuzzy HSP thus becomes SatðAÞ  ... 
doi:10.1016/s0952-1976(01)00008-2 fatcat:jg7jah4fpjdbhm6v53hy63rg5a

On the Complexity and Expressiveness of Automated Planning Languages Supporting Temporal Reasoning

Nicola Gigante
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
constraints.  ...  In recent years, a significant amount of research has focused on planning languages and systems supporting temporal reasoning, recognizing its importance in modeling and solving real-world complex tasks  ...  of temporal constraints.  ... 
doi:10.24963/ijcai.2017/750 dblp:conf/ijcai/Gigante17 fatcat:tmialdne5nge7gx4ppyocv6rfq

Robust temporal logic model predictive control

Sadra Sadraddini, Calin Belta
2015 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)  
In case the temporal logic constraint is infeasible, the controller satisfies a relaxed, minimally violating constraint. An illustrative case study is included.  ...  Control synthesis from temporal logic specifications has gained popularity in recent years.  ...  Temporal logics [5] , such as linear temporal logic (LTL), computational tree logic (CTL), and signal temporal logic (STL), are able to describe a wide range of specifications.  ... 
doi:10.1109/allerton.2015.7447084 dblp:conf/allerton/SadraddiniB15 fatcat:4zt6545y3zeitokzmvwcacs24y

Temporal reasoning in process planning

1999 Artificial intelligence for engineering design, analysis and manufacturing  
To fill the void, we propose in this paper a practical approach, which is inspired by the framework of Temporal Constraint Satisfaction Problem~TCSP!  ...  We show that a TCSP formulation is a subset of a formulation using a reified temporal logic, and discuss the advantages of using such a restricted model.  ...  Section 3 is devoted to the introduction of the temporal constraint satisfaction problem. In the following subsection~2.1! we formulate Example 1 in temporal logic.  ... 
doi:10.1017/s0890060499132049 fatcat:tio72osp3re4rpfo7blh2rmbya

Page 4617 of Mathematical Reviews Vol. , Issue 2003f [page]

2003 Mathematical Reviews  
Kolaitis, First-order logic vs. fixed-point logic in finite set theory (275-284); Joachim Niehren, Martin Miiller [Martin Miiller?]  ...  satisfaction problem (565-569); Marco Cadoli, The expressive power of binary linear programming (570-574). 2003f:68004 68-06 03-06 03B70 * 14th Symposium on Logic in Computer Science.  ... 

Fuzzy Branching Temporal Logic

S. Moon, K.H. Lee, D. Lee
2004 IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)  
In this paper, fuzzy branching temporal logic (FBTL) is proposed to address this problem. FBTL adopts and generalizes concurrent tree logic (CTL*), which is a classical branching temporal logic.  ...  The utility of FBTL is demonstrated using a fuzzy job shop scheduling problem as an example. Index Terms-Branching temporal logic, CTL*, fuzzy logic, temporal logic.  ...  The temporal constraint satisfaction problem (TCSP) was explored by Dechter et al. [12] . In this problem, relationships among time intervals are represented by a temporal constraint network (TCN).  ... 
doi:10.1109/tsmcb.2003.819485 pmid:15376850 fatcat:bvbgu7ztdfgltpoqxkgchrknh4

Forthcoming Papers

2002 Artificial Intelligence  
In this paper we give a short introduction to logic programming approach to knowledge representation and reasoning.  ...  Applications of this method to planning are related to the line of research on the frame problem that started with the invention of formal nonmonotonic reasoning in 1980.   ...  Among these problems are constraint satisfaction problems with bounded treewidth and fixed domain, restricted forms of conjunctive database queries, restricted satisfiability problems, propositional logic  ... 
doi:10.1016/s0004-3702(02)00216-3 fatcat:iqng4adjcbanxh46bjczyyedaa

Recurrent Neural Network Controllers for Signal Temporal Logic Specifications Subject to Safety Constraints [article]

Wenliang Liu, Noushin Mehdipour, Calin Belta
2020 arXiv   pre-print
We validate our theoretical formulation and demonstrate its performance in an optimal control problem subject to partially unknown safety constraints through simulations.  ...  RNNs can store information of a system over time, thus, enable us to determine satisfaction of the dynamic temporal requirements specified in STL formulae.  ...  Employing neural networks (NN) in temporal logic control was proposed recently.  ... 
arXiv:2009.11468v1 fatcat:rdhuxj3xr5glxjvlbhckxnxvlq

Scheduling Aircraft Using Constraint Satisfaction

Pim van Leeuwen, Henk Hesselink, Jos Rohling
2002 Electronical Notes in Theoretical Computer Science  
In this paper, an airport departure scheduling tool for aircraft is presented based on constraint satisfaction techniques.  ...  This goal is accomplished by modelling the scheduling problem as a constraint satisfaction problem, using ILOG Solver and Scheduler as an implementation environment.  ...  Stating the Problem as a Constraint Satisfaction Problem To solve the departure management problem using constraint satisfaction, we need to formulate it as a Constraint Satisfaction Programming (CSP)  ... 
doi:10.1016/s1571-0661(04)80797-7 fatcat:udomdbwphndclgu6yadj5redqy
« Previous Showing results 1 — 15 out of 21,220 results