Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Conditional narrowing modulo a set of equations (1993)
    Springer
    Applicable algebra in engineering, communication and computing 4 (1993), S. 147-168 
    Details
    ISSN: 1432-0622
    Keywords: Conditional rewriting ; Conditional narrowing ; E-unification ; Constraint logic and functional programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics , Technology
    Notes: Abstract Narrowing is a universal unification procedure for equational theories given by a canonical term rewrite system. In this paper we introduce conditional narrowing modulo a set of conditional equations and give a full proof of its correctness and completeness for equational conditional rewrite systemsR, E without extravariables whereE is regular andR, E is Church-Rosser moduloE and decreasing moduloE. This result can be seen as the theoretical foundation of a special form of constraint logic and functional programming.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01202035
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A note on a canonical theory with undecidable unification and matching problem (1987)
    Springer
    Journal of automated reasoning 3 (1987), S. 379-381 
    Details
    ISSN: 1573-0670
    Keywords: Unification ; Matching ; Equational Theories ; Canonical Term Rewriting Systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A natural example of a canonical theory with undecidable unification and matching problem is presented.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00247435
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Modelling discrete optimisation problems inconstraint logic programming (1998)
    Springer
    Annals of operations research 81 (1998), S. 467-496 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Constraint logic programming has become a promising new technology for solving complexcombinatorial problems. In this paper, we investigate how (constraint) logic programmingcan support the modelling part when solving discrete optimisation problems. First, we showthat the basic functionality of algebraic modelling languages can be realised very easily ina pure logic programming system like PROLOG and that, even without using constraints,various additional features are available. Then we focus on the constraint-solving facilitiesoffered by constraint logic programming systems. In particular, we explain how the constraintsolver of the constraint logic programming language CLP(PB) can be used in modelling0 - 1 problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1018981813157
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...