Results 1  10
of
160
Constraint Logic Programming: A Survey
"... Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in differe ..."
Abstract

Cited by 774 (24 self)
 Add to MetaCart
Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in different areas of applications. In this survey of CLP, a primary goal is to give a systematic description of the major trends in terms of common fundamental concepts. The three main parts cover the theory, implementation issues, and programming for applications.
Complexity and Expressive Power of Logic Programming
, 1997
"... This paper surveys various complexity results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical results ..."
Abstract

Cited by 287 (57 self)
 Add to MetaCart
This paper surveys various complexity results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical results on plain logic programming (pure Horn clause programs), more recent results on various important extensions of logic programming are surveyed. These include logic programming with different forms of negation, disjunctive logic programming, logic programming with equality, and constraint logic programming. The complexity of the unification problem is also addressed.
Equations and rewrite rules: a survey
 In Formal Language Theory: Perspectives and Open Problems
, 1980
"... bY ..."
HAMPI: A Solver for String Constraints
, 2009
"... Many automatic testing, analysis, and verification techniques for programs can be effectively reduced to a constraintgeneration phase followed by a constraintsolving phase. This separation of concerns often leads to more effective and maintainable tools. The increasing efficiency of offtheshelf ..."
Abstract

Cited by 68 (19 self)
 Add to MetaCart
Many automatic testing, analysis, and verification techniques for programs can be effectively reduced to a constraintgeneration phase followed by a constraintsolving phase. This separation of concerns often leads to more effective and maintainable tools. The increasing efficiency of offtheshelf constraint solvers makes this approach even more compelling. However, there are few effective and sufficiently expressive offtheshelf solvers for string constraints generated by analysis techniques for stringmanipulating programs. We designed and implemented Hampi, a solver for string constraints over fixedsize string variables. Hampi constraints express membership in regular languages and fixedsize contextfree languages. Hampi constraints may contain contextfreelanguage definitions, regularlanguage definitions and operations, and the membership predicate. Given a set of constraints, Hampi outputs a string that satisfies all the constraints, or reports that the constraints are unsatisfiable. Hampi is expressive and efficient, and can be successfully applied to testing and analysis of real programs. Our experiments use Hampi in: static and dynamic analyses for finding SQL injection vulnerabilities in Web applications; automated bug finding in C programs using systematic testing; and compare Hampi with another string solver. Hampi’s source code, documentation, and the experimental data are available at
On the Undecidability of SecondOrder Unification
 INFORMATION AND COMPUTATION
, 2000
"... ... this paper, and it is the starting point for proving some novel results about the undecidability of secondorder unification presented in the rest of the paper. We prove that secondorder unification is undecidable in the following three cases: (1) each secondorder variable occurs at most t ..."
Abstract

Cited by 33 (16 self)
 Add to MetaCart
... this paper, and it is the starting point for proving some novel results about the undecidability of secondorder unification presented in the rest of the paper. We prove that secondorder unification is undecidable in the following three cases: (1) each secondorder variable occurs at most twice and there are only two secondorder variables; (2) there is only one secondorder variable and it is unary; (3) the following conditions (i)#(iv) hold for some fixed integer n: (i) the arguments of all secondorder variables are ground terms of size <n, (ii) the arity of all secondorder variables is <n, (iii) the number of occurrences of secondorder variables is #5, (iv) there is either a single secondorder variable or there are two secondorder variables and no firstorder variables.
A New Method for Undecidability Proofs of First Order Theories
 Journal of Symbolic Computation
, 1992
"... this paper is to define a framework for such reduction proofs. The method proposed is illustrated by proving the undecidability of the theory of a term algebra modulo the axioms of associativity and commutativity and of the theory of a partial lexicographic path ordering. 1. Introduction ..."
Abstract

Cited by 30 (7 self)
 Add to MetaCart
this paper is to define a framework for such reduction proofs. The method proposed is illustrated by proving the undecidability of the theory of a term algebra modulo the axioms of associativity and commutativity and of the theory of a partial lexicographic path ordering. 1. Introduction
Birewrite systems
, 1996
"... In this article we propose an extension of term rewriting techniques to automate the deduction in monotone preorder theories. To prove an inclusion a ⊆ b from a given set I of them, we generate from I, using a completion procedure, a birewrite system 〈R⊆, R⊇〉, that is, a pair of rewrite relations ..."
Abstract

Cited by 29 (9 self)
 Add to MetaCart
In this article we propose an extension of term rewriting techniques to automate the deduction in monotone preorder theories. To prove an inclusion a ⊆ b from a given set I of them, we generate from I, using a completion procedure, a birewrite system 〈R⊆, R⊇〉, that is, a pair of rewrite relations −−− → R ⊆ and −−− → R ⊇ , and seek a common term c such that a −−−→ R ⊆ c and b −−−→
On Equality Upto Constraints over Finite Trees, Context Unification, and OneStep Rewriting
"... We introduce equality upto constraints over finite trees and investigate their expressiveness. Equality upto constraints subsume equality constraints, subtree constraints, and onestep rewriting constraints. ..."
Abstract

Cited by 27 (7 self)
 Add to MetaCart
We introduce equality upto constraints over finite trees and investigate their expressiveness. Equality upto constraints subsume equality constraints, subtree constraints, and onestep rewriting constraints.
Unification with Sequence Variables And Flexible Arity Symbols and its Extension with PatternTerms
 ARTIFICIAL INTELLIGENCE, AUTOMATED REASONING AND SYMBOLIC COMPUTATION. PROC. OF JOINT AISC’2002 – CALCULEMUS’2002 CONFERENCE, VOLUME 2385 OF LNAI
, 2002
"... A minimal and complete unification procedure for a theory with individual and sequence variables, free constants and free fixed and flexible arity function symbols is described and a brief overview of an extension with patternterms is given. ..."
Abstract

Cited by 27 (14 self)
 Add to MetaCart
A minimal and complete unification procedure for a theory with individual and sequence variables, free constants and free fixed and flexible arity function symbols is described and a brief overview of an extension with patternterms is given.