Linear time-dependent constraints programming with MSVL (Q2015809): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 5 users not shown)
Property / reviewed by
 
Property / reviewed by: Q261361 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: K. Subramani and Vahan Mkrtchyan / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MuTACLP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Esterel / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SMT-LIB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-012-9551-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972480948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining knowledge about temporal intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4707757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Esterel synchronous programming language: Design, semantics, implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction problems: Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming in metric temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized simplex method for minimizing a linear form under linear inequality restraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditional secure communication: a Russian cards protocol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Framed temporal logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal annotated constraint logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3729994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with continuous change / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining qualitative and quantitative constraints in temporal reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3150207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Timed default concurrent constraint programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operational semantics of Framed Tempura / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatic semantics of projection temporal logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cylinder computation model for many-core parallel computing / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:44, 8 July 2024

scientific article
Language Label Description Also known as
English
Linear time-dependent constraints programming with MSVL
scientific article

    Statements

    Linear time-dependent constraints programming with MSVL (English)
    0 references
    0 references
    0 references
    24 June 2014
    0 references
    The paper is concerned with specifying and solving linear time-dependent constraints with MSVL. In particular, the focus is on linear equalities and strict inequalities. The main contributions of the paper are the following: {\parindent=6mm \begin{itemize}\item[1.] Linear constraint statements are defined within the specification language of MSVL. \item[2.] Operational semantics for linear constraints are provided. \item[3.] The soundness of the operational rules for linear constraints is rigorously established. \end{itemize}} The authors did a thorough job of explaining the problem that they study and of deriving the appropriate results. The paper itself is a good addition to the overall literature in the fields of program semantics and formal verification. The paper is well-written. There are a few places where articles (such as ``the'') are used incorrectly, but on the whole the exposition is good. The discussion on related work is thorough. The authors describe (albeit briefly) all the major advances in the field of logic programming and in particular temporal logic programming. I could not discover any error in the proofs given in the paper and the work is clearly original. The contributions made by the authors are well-laid-out and clear. Using MSVL to capture linear constraints was not known prior to their work. They also plan to combine their techniques with common SMT solvers. It follows that their work is original and impressive.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    time-dependent constraints
    0 references
    interval temporal logic programming
    0 references
    MSVL
    0 references
    operational semantics
    0 references
    0 references
    0 references
    0 references
    0 references