Extensions of Logic Programming: Third International Workshop, ELP '92, Bologna, Italy, February 26-28, 1992. Proceedings
This book contains papers which investigate how to extend logic programming toward the artificial intelligence and software engineering areas, covering both theoretical and practical aspects. Some papers investigate topics such as abductive reasoning and negation. Some works discuss how to enhance the expressive power of logic programming by introducing constraints, sets, and integration with functional programming. Other papers deal with the structuring of knowledge into modules, taxonomies, and objects, withthe aim of extending logic programming toward software engineering applications. A section is devoted to papers concentrating on proof theory and inspired by Gentzen-style sequent or natural deduction systems. Topics such as concurrency are considered to enhance the expressive power of logic languages. Finally, some papers mainly concernimplementation techniques for some of these logic programming extensions.
O que estão dizendo - Escrever uma resenha
Não encontramos nenhuma resenha nos lugares comuns.
Outras edições - Visualizar todos
A-sufficient substitutions abstract algorithm answer atomic axioms blackboard clause logic co-agents compilation Computer Science conjunction consider constants constraint Constraint Logic Programming constructors corresponding data structures deductive database defined definiens definition denote derivation disjunctive dynamic equivalent example execution expression extension finite formula function symbol functional programming given goal G Herbrand base Herbrand crossbase Herbrand universe Horn clauses implementation implication goal induction inference rules input instance instantiated interpretation introduced introduction rules Kripke-like model lemma linear logic literal Logic Pro logic programming language metaterm modal module multiset natural deduction normal equational theory notion occurrence operational semantics output predicate symbol Proc procedure program clauses program context Prolog proof proposition query reduction relational relational-functional program represented satisfies search tree sequent sequent calculus SLWV solving stable model static subgoal subset syntactic syntax Theorem unifiable updates variables