Results 11 to 20 of about 1,803,631 (274)
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
Economic modelling using constraint logic programming [PDF]
, 1996 This paper investigates the use of constraint logic programming (CLP) in economic modelling through the design and implementation of two economic models.
Gilbert, D, Donovan, N
core +6 more sources
Transient analysis and synthesis of linear circuits using constraint logic programming [PDF]
, 1996 In this paper describes the design of a transient analysis program for linear circuits and its implementation in a Constraint Logic Programming language, CLP(R).
Gilbert, D, Jampel, M, Shankar, A
core +6 more sources
Constraint Logic Programming approach to protein structure prediction
BMC Bioinformatics, 2004 Background The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information and/or simplified protein models.
Fogolari Federico +2 more
doaj +1 more source
Research Report on Automatic Synthesis of Local Search Neighborhood Operators [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Constraint Programming (CP) and Local Search (LS) are different paradigms for dealing with combinatorial search and optimization problems. Their complementary features motivated researchers to create hybrid CP/LS solutions, maintaining both the modeling ...
Mateusz Ślażyński
doaj +1 more source
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
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
A Logic Programming Approach to Repairing SHACL Constraint Violations [PDF]
Transactions on Graph Data and KnowledgeThe Shapes Constraint Language (SHACL) is a recent standard, a W3C recommendation, for validating RDF graphs against shape constraints to be checked on target nodes of a data graph.
Ahmetaj, Shqiponja +3 more
doaj +1 more source