Results 1  10
of
1,794
Integrating Disequations in the Algebraic and Logic Programming Language LPG
 In Proc. of the ICLP’94 PostConference Workshop on Integration of Declarative Paradigms. MPII94224, Saarbrucken
, 1994
"... : This paper gives a brief description of the recent improvements of the algebraic and logic programming language lpg. We mainly introduce the possibility to use disequations (negation of equations), which involve user's definable functions, in the definition of predicates. Then we describe the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
the operational semantics of lpg which is based on an extension of SLD\Gammaresolution in order to deal with equations and disequations. Also, we give new sufficient conditions to ensure the completeness of narrowing strategies, to solve equations and disequations, in the presence of conditional term rewrite
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 864 (25 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
On solving systems of random linear disequations
 Quantum Information & Computation 8(67
, 2008
"... An important subcase of the hidden subgroup problem is equivalent to the shift problem over abelian groups. An efficient solution to the latter problem would serve as a building block of quantum hidden subgroup algorithms over solvable groups. The main idea of a promising approach to the shift probl ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
problem is reduction to solving systems of certain random disequations in finite abelian groups. The random disequations are actually generalizations of linear functions distributed nearly uniformly over those not containing a specific group element in the kernel. In this paper we give an algorithm which
Theory and Practice of Constraint Handling Rules
, 1998
"... Constraint Handling Rules (CHR) are our proposal to allow more flexibility and applicationoriented customization of constraint systems. CHR are a declarative language extension especially designed for writing userdefined constraints. CHR are essentially a committedchoice language consisting of mu ..."
Abstract

Cited by 459 (36 self)
 Add to MetaCart
of multiheaded guarded rules that rewrite constraints into simpler ones until they are solved. In this broad survey we aim at covering all aspects of CHR as they currently present themselves. Going from theory to practice, we will define syntax and semantics for CHR, introduce an important decidable
DISEQUALIZING INPUT TO THE SOCIAL SYSTEM by
, 2007
"... How terrorism works terrorism as a disequalizing input to the social system ..."
Abstract
 Add to MetaCart
How terrorism works terrorism as a disequalizing input to the social system
Solving Disequations modulo some Class of Rewrite Systems
, 1998
"... . This paper gives a procedure for solving disequations modulo equational theories, and to decide existence of solutions. For this, we assume that the equational theory is specified by a confluent and constructorbased rewrite system, and that four additional restrictions are satisfied. The procedur ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
. This paper gives a procedure for solving disequations modulo equational theories, and to decide existence of solutions. For this, we assume that the equational theory is specified by a confluent and constructorbased rewrite system, and that four additional restrictions are satisfied
Disequalities May Help to Narrow
"... A constructorbased rewriting logic (CRWL) has been recently proposed as an appropriate basis for functional logic programming. In this paper we extend such framework, to cope with disequality constraints, which are a useful and expressive resource from the point of view of programming. As an import ..."
Abstract
 Add to MetaCart
A constructorbased rewriting logic (CRWL) has been recently proposed as an appropriate basis for functional logic programming. In this paper we extend such framework, to cope with disequality constraints, which are a useful and expressive resource from the point of view of programming
Combining Lazy Narrowing with Disequality Constraints
 In Proc. of the 6th International Symposium on Programming Language Implementation and Logic Programming
, 1994
"... . We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the language are derived from the fact that it can be viewed as an instance of the CFLP (X)scheme proposed in [Lo92] for constraint fu ..."
Abstract

Cited by 18 (4 self)
 Add to MetaCart
. We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the language are derived from the fact that it can be viewed as an instance of the CFLP (X)scheme proposed in [Lo92] for constraint
The Integration of Functions into Logic Programming: From Theory to Practice
 Journal of Logic Programming
, 1994
"... Abstract. Functional logic programming languages combine the most important declarative programming paradigms, and attempts to combine these paradigms have a long history. The declarative multiparadigm language Curry is influenced by recent advances in the foundations and implementation of function ..."
Abstract

Cited by 362 (59 self)
 Add to MetaCart
Abstract. Functional logic programming languages combine the most important declarative programming paradigms, and attempts to combine these paradigms have a long history. The declarative multiparadigm language Curry is influenced by recent advances in the foundations and implementation of functional logic languages. The development of Curry is an international initiative intended to provide a common platform for the research, teaching, and application of integrated functional logic languages. This paper surveys the foundations of functional logic programming that are relevant for Curry, the main features of Curry, and extensions and applications of Curry and functional logic programming. 1
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 360 (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.
Results 1  10
of
1,794