Narrow your search

Library

ULiège (3)

KBR (2)

KU Leuven (2)

UAntwerpen (1)

UCLouvain (1)

UGent (1)

UHasselt (1)

ULB (1)

UMons (1)

UNamur (1)


Resource type

book (3)


Language

English (3)


Year
From To Submit

2004 (1)

1991 (2)

Listing 1 - 3 of 3
Sort by
Parallel execution of logic programs. ICLP'91. Pre-conference workshop, Paris, June 24, 1991. Proceedings
Authors: ---
ISBN: 0387550380 Year: 1991 Volume: vol 569 Publisher: Berlin ; New York, NY : Springer-Verlag,

Logic programming 89 : proceedings of the 8th conference, Tokyo, Japan, July 1989
Authors: --- ---
ISBN: 3540539190 0387539190 3540463984 Year: 1991 Volume: 485 *29 Publisher: Berlin ; New York, NY : Springer-Verlag,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This volume contains selected papers presented at the Eighth Logic Programming Conference, held in Tokyo, 1989. Various topics in logic programming are covered. The first paper is an invited talk by Prof. Donald Michie, Chief Scientist of the Turing Institute, entitled "Human and Machine Learning of Descriptive Concepts", and introduces various research results on learning obtained by his group. There are eleven further papers, organized into sections on reasoning, logic programming language, concurrent programming, knowledge programming, natural language processing, and applications. A paper on knowledge programming introduces a flexible and powerful tool for incorporating and organizing knowledge using hypermedia. Another paper presents the constraint logic programming language cu-Prolog, designed for combinatorial problems; the way cu-Prolog solves the constraints is based on program transformation.

Logic in computer science : modelling and reasoning about systems
Authors: ---
ISBN: 052154310X 9780521543101 Year: 2004 Publisher: Cambridge : Cambridge University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

The second edition of this successful textbook continues to provide a clear introduction to formal reasoning relevant to the needs of modern computer science and sufficiently exacting for practical applications. Improvements have been made throughout with many new and expanded text sections. The coverage of model-checking has been substantially updated and additional exercises are included. Internet support includes worked solutions for teacher exercises and model solutions to some student exercises. First Edition Hb (2000): 0-521-65200-6 First Edition Pb (2000): 0-521-65602-8

Keywords

Computer logic --- Logic programming (Computer science) --- Computer logic. --- Logic programming. --- Logic programming (Computer science). --- Logique informatique --- 681.3*F11 <043> --- Models of computation: automata bounded action devices computability theory relations among models self-modifying machines unbounded-action devices--See also {681.3*F41}--Dissertaties --- 681.3*F11 <043> Models of computation: automata bounded action devices computability theory relations among models self-modifying machines unbounded-action devices--See also {681.3*F41}--Dissertaties --- 681.3*F41 Mathematical logic: computability theory computational logic lambda calculus logic programming mechanical theorem proving model theory proof theoryrecursive function theory--See also {681.3*F11} {681.3*I22} {681.3*I23} --- Mathematical logic: computability theory computational logic lambda calculus logic programming mechanical theorem proving model theory proof theoryrecursive function theory--See also {681.3*F11} {681.3*I22} {681.3*I23} --- 681.3*F11 Models of computation: automata bounded action devices computability theory relations among models self-modifying machines unbounded-action devices--See also {681.3*F41} --- Models of computation: automata bounded action devices computability theory relations among models self-modifying machines unbounded-action devices--See also {681.3*F41} --- computermodel --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Logic programming --- 681.3*F11 <043> Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41}--Dissertaties --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41}--Dissertaties --- Computer programming --- Computer science logic --- Logic, Symbolic and mathematical --- 681.3*F11 --- 681.3*F41 --- computerarchitectuur --- kunstmatige intelligentie (artificiële intelligentie) --- Computer science --- Mathematical logic --- Computer programs --- Logiciels --- Verification --- Vérification --- Informatique --- Logique mathématique --- Logique mathématique --- Vérification

Listing 1 - 3 of 3
Sort by