Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Berlin u.a. : Springer
    UID:
    b3kat_BV035718071
    Format: 1 Online-Ressource (VIII, 360 S. , graph. Darst.)
    ISBN: 3540580255 , 0387580255
    Series Statement: Lecture notes in computer science 798 : Lecture notes in artificial intelligence
    Note: Literaturangaben
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Logische Programmierung ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    almafu_BV009555993
    Format: VIII, 360 S. : , graph. Darst.
    ISBN: 3-540-58025-5 , 0-387-58025-5
    Series Statement: Lecture notes in computer science 798 : Lecture notes in artificial intelligence
    Note: Literaturangaben
    Language: English
    Subjects: Computer Science
    RVK:
    RVK:
    Keywords: Logische Programmierung ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    gbv_595125425
    Format: Online-Ressource (VIII, 360 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540484172
    Series Statement: Lecture notes in computer science 798
    Content: Design for AKL with intelligent pruning -- Contradiction: When avoidance equals removal Part I -- Birkhoff's HSP-theorem for cumulative logic programs -- Finite domains and exclusions as first-class citizens -- Some experimental results in implementing a logic language with multi-head clauses on a Transputer architecture -- A language with finite sets embedded in the CLP-scheme -- Finitary partial inductive definitions as a general logic -- Programming methodologies in GCLA -- Computing cost estimates for proof strategies -- Logic programming with multiple context management schemes -- Non-procedural logic programming -- Axioms in definitional calculi -- A proposal for modules in ?Prolog -- Regular search spaces as a foundation of logic programming -- Answer sets and nonmonotonic S4 -- Contradiction: When avoidance equals removal Part II -- Cut formulae and logic programming -- Higher-order aspects of logic programming -- Representation and inference with consistent temporal propositions -- Definitional reflection and the completion -- Linear logic semantics for Concurrent Prolog.
    Content: The papers in this volume are extended versions of presentations at the fourth International Workshop on Extensions of Logic Programming, held at the University of St Andrews, March/April 1993. Among the topics covered in the volume are: defintional reflection and completion, modules in lambda-Prolog, representation of logics as partial inductive definitions, non-procedural logic programming, knowledge representation, contradiction avoidance, disjunctive databases, strong negation, linear logic programming, proof theory and regular search spaces, finite sets and constraint logic programming, search-space pruning and universal algebra, and implementation on transputer networks.
    Note: Literaturangaben
    Additional Edition: ISBN 3540580255
    Additional Edition: ISBN 9783540580256
    Additional Edition: Erscheint auch als Druck-Ausgabe Extensions of logic programming Berlin : Springer, 1994 ISBN 3540580255
    Additional Edition: ISBN 0387580255
    Language: English
    Subjects: Computer Science
    RVK:
    RVK:
    Keywords: Logische Programmierung ; Logische Programmierung ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    b3kat_BV009555993
    Format: VIII, 360 S. , graph. Darst.
    ISBN: 3540580255 , 0387580255
    Series Statement: Lecture notes in computer science 798 : Lecture notes in artificial intelligence
    Note: Literaturangaben
    Language: English
    Subjects: Computer Science
    RVK:
    RVK:
    Keywords: Logische Programmierung ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    UID:
    almahu_9947920624902882
    Format: VIII, 368 p. , online resource.
    ISBN: 9783540484172
    Series Statement: Lecture Notes in Computer Science, Lecture Notes in, 798
    Content: The papers in this volume are extended versions of presentations at the fourth International Workshop on Extensions of Logic Programming, held at the University of St Andrews, March/April 1993. Among the topics covered in the volume are: defintional reflection and completion, modules in lambda-Prolog, representation of logics as partial inductive definitions, non-procedural logic programming, knowledge representation, contradiction avoidance, disjunctive databases, strong negation, linear logic programming, proof theory and regular search spaces, finite sets and constraint logic programming, search-space pruning and universal algebra, and implementation on transputer networks.
    Note: Design for AKL with intelligent pruning -- Contradiction: When avoidance equals removal Part I -- Birkhoff's HSP-theorem for cumulative logic programs -- Finite domains and exclusions as first-class citizens -- Some experimental results in implementing a logic language with multi-head clauses on a Transputer architecture -- A language with finite sets embedded in the CLP-scheme -- Finitary partial inductive definitions as a general logic -- Programming methodologies in GCLA -- Computing cost estimates for proof strategies -- Logic programming with multiple context management schemes -- Non-procedural logic programming -- Axioms in definitional calculi -- A proposal for modules in ?Prolog -- Regular search spaces as a foundation of logic programming -- Answer sets and nonmonotonic S4 -- Contradiction: When avoidance equals removal Part II -- Cut formulae and logic programming -- Higher-order aspects of logic programming -- Representation and inference with consistent temporal propositions -- Definitional reflection and the completion -- Linear logic semantics for Concurrent Prolog.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540580256
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    UID:
    almahu_9948621568402882
    Format: VIII, 368 p. , online resource.
    Edition: 1st ed. 1994.
    ISBN: 9783540484172
    Series Statement: Lecture Notes in Artificial Intelligence ; 798
    Content: The papers in this volume are extended versions of presentations at the fourth International Workshop on Extensions of Logic Programming, held at the University of St Andrews, March/April 1993. Among the topics covered in the volume are: defintional reflection and completion, modules in lambda-Prolog, representation of logics as partial inductive definitions, non-procedural logic programming, knowledge representation, contradiction avoidance, disjunctive databases, strong negation, linear logic programming, proof theory and regular search spaces, finite sets and constraint logic programming, search-space pruning and universal algebra, and implementation on transputer networks.
    Note: Design for AKL with intelligent pruning -- Contradiction: When avoidance equals removal Part I -- Birkhoff's HSP-theorem for cumulative logic programs -- Finite domains and exclusions as first-class citizens -- Some experimental results in implementing a logic language with multi-head clauses on a Transputer architecture -- A language with finite sets embedded in the CLP-scheme -- Finitary partial inductive definitions as a general logic -- Programming methodologies in GCLA -- Computing cost estimates for proof strategies -- Logic programming with multiple context management schemes -- Non-procedural logic programming -- Axioms in definitional calculi -- A proposal for modules in ?Prolog -- Regular search spaces as a foundation of logic programming -- Answer sets and nonmonotonic S4 -- Contradiction: When avoidance equals removal Part II -- Cut formulae and logic programming -- Higher-order aspects of logic programming -- Representation and inference with consistent temporal propositions -- Definitional reflection and the completion -- Linear logic semantics for Concurrent Prolog.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662201664
    Additional Edition: Printed edition: ISBN 9783540580256
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    UID:
    gbv_1649306741
    Format: Online-Ressource
    ISBN: 9783540484172
    Series Statement: Lecture Notes in Computer Science 798
    Additional Edition: ISBN 9783540580256
    Additional Edition: Buchausg. u.d.T. Extensions of logic programming Berlin : Springer, 1994 ISBN 3540580255
    Additional Edition: ISBN 0387580255
    Language: English
    Subjects: Computer Science
    RVK:
    RVK:
    Keywords: Logische Programmierung ; Konferenzschrift
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    UID:
    edocfu_9959186484502883
    Format: 1 online resource (VIII, 368 p.)
    Edition: 1st ed. 1994.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-48417-5
    Series Statement: Lecture Notes in Artificial Intelligence ; 798
    Content: The papers in this volume are extended versions of presentations at the fourth International Workshop on Extensions of Logic Programming, held at the University of St Andrews, March/April 1993. Among the topics covered in the volume are: defintional reflection and completion, modules in lambda-Prolog, representation of logics as partial inductive definitions, non-procedural logic programming, knowledge representation, contradiction avoidance, disjunctive databases, strong negation, linear logic programming, proof theory and regular search spaces, finite sets and constraint logic programming, search-space pruning and universal algebra, and implementation on transputer networks.
    Note: Design for AKL with intelligent pruning -- Contradiction: When avoidance equals removal Part I -- Birkhoff's HSP-theorem for cumulative logic programs -- Finite domains and exclusions as first-class citizens -- Some experimental results in implementing a logic language with multi-head clauses on a Transputer architecture -- A language with finite sets embedded in the CLP-scheme -- Finitary partial inductive definitions as a general logic -- Programming methodologies in GCLA -- Computing cost estimates for proof strategies -- Logic programming with multiple context management schemes -- Non-procedural logic programming -- Axioms in definitional calculi -- A proposal for modules in ?Prolog -- Regular search spaces as a foundation of logic programming -- Answer sets and nonmonotonic S4 -- Contradiction: When avoidance equals removal Part II -- Cut formulae and logic programming -- Higher-order aspects of logic programming -- Representation and inference with consistent temporal propositions -- Definitional reflection and the completion -- Linear logic semantics for Concurrent Prolog.
    In: Springer eBooks
    Additional Edition: ISBN 3-540-58025-5
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    UID:
    edoccha_9959186484502883
    Format: 1 online resource (VIII, 368 p.)
    Edition: 1st ed. 1994.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-48417-5
    Series Statement: Lecture Notes in Artificial Intelligence ; 798
    Content: The papers in this volume are extended versions of presentations at the fourth International Workshop on Extensions of Logic Programming, held at the University of St Andrews, March/April 1993. Among the topics covered in the volume are: defintional reflection and completion, modules in lambda-Prolog, representation of logics as partial inductive definitions, non-procedural logic programming, knowledge representation, contradiction avoidance, disjunctive databases, strong negation, linear logic programming, proof theory and regular search spaces, finite sets and constraint logic programming, search-space pruning and universal algebra, and implementation on transputer networks.
    Note: Design for AKL with intelligent pruning -- Contradiction: When avoidance equals removal Part I -- Birkhoff's HSP-theorem for cumulative logic programs -- Finite domains and exclusions as first-class citizens -- Some experimental results in implementing a logic language with multi-head clauses on a Transputer architecture -- A language with finite sets embedded in the CLP-scheme -- Finitary partial inductive definitions as a general logic -- Programming methodologies in GCLA -- Computing cost estimates for proof strategies -- Logic programming with multiple context management schemes -- Non-procedural logic programming -- Axioms in definitional calculi -- A proposal for modules in ?Prolog -- Regular search spaces as a foundation of logic programming -- Answer sets and nonmonotonic S4 -- Contradiction: When avoidance equals removal Part II -- Cut formulae and logic programming -- Higher-order aspects of logic programming -- Representation and inference with consistent temporal propositions -- Definitional reflection and the completion -- Linear logic semantics for Concurrent Prolog.
    In: Springer eBooks
    Additional Edition: ISBN 3-540-58025-5
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 9783540283256?
Did you mean 9783540308256?
Did you mean 9783540280156?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages