Results 11 to 20 of about 3,012,120 (253)
Transforming constraint logic programs [PDF]
Theoretical Computer Science, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guessarian, Irene, Bensaou, N.
openaire +5 more sources
Independence in constraint logic programs [PDF]
, 1993 Studying independence of literals, variables, and substitutions has proven very useful in the context of logic programming (LP). Here we study independence in the broader context of constraint logic programming (CLP). We show that a naive extrapolation of the LP definitions of independence to CLP is unsatisfactory (in fact, wrong) for two reasons ...
García de la Banda, M. +2 more
openaire +4 more sources
Timetabling in constraint logic programming [PDF]
, 1996 In this paper we describe the timetabling problem and its solvability in a Constraint Logic Programming Language. A solution to the problem has been developed and implemented in ECLiPSe, since it deals with finite domains, it has well-defined ...
Kambi, M +3 more
core +6 more sources
Arginine methylation as a regulatory ratchet in cancer: From substrate selection to malignant-state stabilization. [PDF]
Mol OncolArginine methylation can be viewed as a persistence‐prone post‐translational modification regulated by a network of PRMTs. Competitive and compensatory interactions among PRMTs can redistribute methylation across substrate pools shaped by sequence, structural, spatial, and environmental layers, reinforcing RNA‐processing, chromatin, and signaling ...
Kwon SH, Lee JM.
europepmc +2 more sources
Logic programming and constraint logic programming [PDF]
ACM Computing Surveys, 1996 Logic programming is a language paradigm based on logic, more specifically on resolution theorem proving in the predicate calculus as proposed in Robinson [1965]. Robinson had the foresight to distinguish the importance of two components in automatic theorem proving: a single inference rule called resolution and the testing for equality of trees called
openaire +2 more sources
Selective Unification in (Constraint) Logic Programming* [PDF]
Fundamenta Informaticae, 2017 Concolic testing is a well-known validation technique for imperative and object oriented programs. In a previous paper, we have introduced an adaptation of this technique to logic programming. At the heart of our framework lies a specific procedure that we call “selective unification”.
Fred Mesnard +2 more
openaire +7 more sources
An assertion language for constraint logic programs [PDF]
, 2000 In an advanced program development environment, such as that discussed in the introduction of this book, several tools may coexist which handle both the program and information on the program in different ways.
Francisco Bueno +5 more
core +1 more source
IEEE Access, 2019 Program slicing, as a technique of program decomposition, is widely used in the field of program testing, model checking, software verification, symbolic execution, and other fields.
Shengbing Ren, Mengyu Jia
doaj +1 more source
Weight prioritized slicing based on constraint logic programming for fault localization.
PLoS ONE, 2020 Fault localization, a technique to fix and ensure the dependability of software, is rapidly becoming infeasible due to the increasing scale and complexity of multilingual programs.
Shengbing Ren +3 more
doaj +1 more source
Logic programming with temporal constraints [PDF]
Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96), 2002 Combines logic programming and temporal constraint processing techniques in a language called TCLP (Temporal Constraint Logic Programming), which augments logic programs with temporal constraints. Known algorithms for processing disjunctions in temporal constraint networks are applied.
Schwalb, Eddie, Vila, Lluis
openaire +2 more sources