HANDBOOK OF LOGIC IN ARTIFICIAL INTELLIGENCE AND LOGIC PROGRAMMING
|
|
- Baldric Gibson
- 6 years ago
- Views:
Transcription
1 HANDBOOK OF LOGIC IN ARTIFICIAL INTELLIGENCE AND LOGIC PROGRAMMING Volume 5 Logic Programming Edited by DOV M. GABBAY and C. J. HOGGER Imperial College of Science, Technology and Medicine London and J. A. ROBINSON Syracuse University, New York CLARENDON PRESS OXFORD 1998
2 vu Contents List of contributors XIV Introduction: Logic and Logic Programming Languages Michael J. O'Donnell 1 1 Introduction Motivation A notational apology 3 2 Specifying logic programming languages Semantic systems and semantic consequences Query Systems, questions and answers Examples of logic programming languages 15 3 Implementing logic programming languages Proof systems Soundness and completeness of proof systems Programming systems Soundness and completeness of programming systems Proof-theoretic foundations for logic programming 56 4 The uses of semantics Logical semantics vs. denotational semantics Logical semantics vs. initial/final-algebra and Herbrand semantics \ 58 Equational Logic Programming Michael J. O'Donnell 69 1 Introduction to equational logic programming Survey of prerequisites, Motivation for programming with equations Outline of the chapter 74 2 Proof systems for equational logic Inferential proofs Term rewriting proofs The confluence property and the completeness of term rewriting 81 3 Term rewriting proof strategies 96
3 viii CONTENTS 3.1 Complete and outer most complete rewriting sequences Sequentiality analysis and optimal rewriting Algorithms and data structures to implement equational languages Ill 4.1 Data structures to represent terms Ill 4.2 Pattern-matching and sequencing methods Driving procedures for term rewriting Compiling efficient code from equations Parallel implementation Extensions to equational logic programming Incremental infinite input and output Solving equations Indeterminate evaluation in subset logic Relational rewriting 151 Proof Procedures for Logic Programming Donald W. Loveland and Gopalan Nadathur Building the framework: the resolution procedure The resolution procedure Linear resolution refinements The logic programming paradigm Horn clause logic programming A framework for logic programming Abstract logic programming languages Extending the logic programming paradigm A language for hypothetical reasoning Near-Horn Prolog Conclusion...> The Role of Abduction in Logic Programming A. C. Kakas, R. A. Kowalski and F. Toni Introduction Abduction in logic Integrity constraints Applications Knowledge assimilation Default reasoning viewed as abduction Negation as failure as abduction Logic programs as abductive frameworks An abductive proof procedure for LP An argumentation-theoretic interpretation 263
4 CONTENTS ix 4.4 An argumentation-theoretic interpretation of the abductive proof procedure Abductive logic programming Generalized stable model semantics An abductive proof procedure for ALP An argumentation-theoretic interpretation of the abductive proof procedure for ALP Computation of abduction through TMS Simulation of abduction Abduction through deduction from the completion Abduction and constraint logic programming Extended logic programming Answer set semantics Restoring consistency of answer sets Rules and exceptions in LP (Extended) Logic Programming without Negation as Failure An argumentation-theoretic approach to ELP A methodology for default reasoning with explicit negation ELP with abduction An abstract argumentation-based framework for default reasoning... : Abduction and truth maintenance Justification-based truth maintenance Assumption-based truth maintenance Conclusions and future work 307 Semantics for Disjunctive and Normal Disjunctive Logic Programs \ Jorge Lobo, Jack Minker and Arcot Rajasekar Introduction Positive consequences in logic programs Definite logic programming Disjunctive logic programming Negation in logic programs Negation in definite logic programs Negation in disjunctive'logic programs Normal or general disjunctive logic programs Stratified definite logic programs Stratified disjunctive logic programs Well-founded and generalized well-founded logic programs 346
5 x CONTENTS 4.4 Generalized disjunctive well-founded semantics Summary Addendum 349 Negation as Failure, Completion and Stratification J. C. Shepherdson Overview/introduction Negation as failure, the closed world assumption and the Clark completion Incompleteness of NF for comp(p) Floundering, an irremovable source of incompleteness Cases where SLDNF-resolution is complete for comp(p) Semantics for negation via special classes of model Semantics for negation using non-classical logics Constructive negation: an extension of negation as failure Concluding remarks Main body Negation in logic programming Negation as failure; SLDNF-resolution The closed world assumption, CWA(P) The Clark completion, comp(p) 374 ^ 2.5 Definite Horn clause programs..." 384 ' 2.6 Three-valued logic Cases where SLDNF-resolution is complete for comp(p): hierarchical, stratified and call-consistent programs Semantics for negation in terms of special classes of models Constructive negation; an extension of negation as failure Modal and autoepistemic logic Deductive calculi for negation as failure, 409 Meta-Programming in Logic Programming P. M. Hill and J. Gallagher Introduction Theoretical foundations Applications Efficiency improvements Preliminaries 427
6 CONTENTS xi 2 The non-ground representation The representation Reflective predicates Meta-programming in Prolog The ground representation The representation Reflective predicates The language Godel and meta-programming Self-applicability Separated meta-programming Amalgamated meta-programming Ambivalent logic Dynamic meta-programming Constructing programs Updating programs The three wise men problem Transforming and specializing programs Specialization of meta-programs Logic program specialization Specialization and compilation Self-applicable program specializers Applications of meta-program specialization Higher-Order Logic Programming Gopalan Nadathur and Dale Miller Introduction " A motivation for higher-order features A higher-order logic The language, Equality between terms \ The notion of derivation A notion of models Predicate variables and the subformula property Higher-order Horn clauses The meaning of computations Restriction to positive terms Provability and operational semantics Towards a practical realization The higher-order unification problem V derivations Designing an actual-interpreter Examples of higher-order programming A concrete syntax for programs 549
7 xii CONTENTS 7.2 Some simple higher-order programs Implementing tactics and tacticals A comparison with functional programming Using A-terms as data structures ' " ' Implementing an interpreter for Horn clauses Dealing with functional programs as data A limitation of higher-order Horn clauses Hereditary Harrop formulas : Universal quantifiers and implications in goals Recursion over structures with binding Conclusion 584 Constraint Logic Programming: A Survey Joxan Jaffar and Michael J. Maher Introduction Constraint languages Logic Programming CLP languages Synopsis Notation and terminology Constraint domains Logical semantics Fixedpoint semantics Top-down execution Soundness and completeness results 615 7, Bottom-up execution Concurrent constraint logic programming Linguistic extensions Shrinking the computation tree \ Complex constraints ' User-defined constraints Negation Preferred solutions Algorithms for constraint solving Incrementality Satisfiability (non-incremental) ' Satisfiability (incremental) Entailment Projection Backtracking Inference engine Delaying/wakeup of goals and constraints Abstract machine 651
8 CONTENTS xiii 11.3 Parallel implementations Modelling of complex problems Analysis and synthesis of analog circuits Options trading analysis Temporal reasoning Combinatorial search problems Cutting stock DNA sequencing Scheduling Chemical hypothetical reasoning Propositional solver Further applications 675 Transformation of Logic Programs Alberto Pettorossi and Maurizio Proietti Introduction A preliminary example Transformation rules for logic programs Syntax of logic programs Semantics of logic programs Unfold/fold rules Correctness of the transformation rules Reversible transformations A derived goal replacement rule The unfold/fold proof method > Correctness results for definite programs _ Correctness results for normal programs Strategies for transforming logic programs Basic strategies Techniques which use basic strategies > Overview of other techniques Partial evaluation and program specialization Related methodologies for program development 771 Index 789
LOGIC AND DISCRETE MATHEMATICS
LOGIC AND DISCRETE MATHEMATICS A Computer Science Perspective WINFRIED KARL GRASSMANN Department of Computer Science University of Saskatchewan JEAN-PAUL TREMBLAY Department of Computer Science University
More informationConstraint Solving. Systems and Internet Infrastructure Security
Systems and Internet Infrastructure Security Network and Security Research Center Department of Computer Science and Engineering Pennsylvania State University, University Park PA Constraint Solving Systems
More informationLogic and its Applications
Logic and its Applications Edmund Burke and Eric Foxley PRENTICE HALL London New York Toronto Sydney Tokyo Singapore Madrid Mexico City Munich Contents Preface xiii Propositional logic 1 1.1 Informal introduction
More informationNotes for Chapter 12 Logic Programming. The AI War Basic Concepts of Logic Programming Prolog Review questions
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions The AI War How machines should learn: inductive or deductive? Deductive: Expert => rules =>
More informationAn Experimental CLP Platform for Integrity Constraints and Abduction
An Experimental CLP Platform for Integrity Constraints and Abduction Slim Abdennadher and Henning Christiansen Computer Science Department, University of Munich Oettingenstr. 67, 80538 München, Germany
More information8. Negation 8-1. Deductive Databases and Logic Programming. (Sommer 2017) Chapter 8: Negation
8. Negation 8-1 Deductive Databases and Logic Programming (Sommer 2017) Chapter 8: Negation Motivation, Differences to Logical Negation Syntax, Supported Models, Clark s Completion Stratification, Perfect
More informationChapter 3: Propositional Languages
Chapter 3: Propositional Languages We define here a general notion of a propositional language. We show how to obtain, as specific cases, various languages for propositional classical logic and some non-classical
More informationFoundations of AI. 9. Predicate Logic. Syntax and Semantics, Normal Forms, Herbrand Expansion, Resolution
Foundations of AI 9. Predicate Logic Syntax and Semantics, Normal Forms, Herbrand Expansion, Resolution Wolfram Burgard, Andreas Karwath, Bernhard Nebel, and Martin Riedmiller 09/1 Contents Motivation
More informationAnswer Sets and the Language of Answer Set Programming. Vladimir Lifschitz
Answer Sets and the Language of Answer Set Programming Vladimir Lifschitz Answer set programming is a declarative programming paradigm based on the answer set semantics of logic programs. This introductory
More informationLogic Programming and Reasoning about Actions
Chapter 4 Logic Programming and Reasoning about Actions [Chitta Baral & Michael Gelfond] In this chapter we discuss how recent advances in logic programming can be used to represent and reason about actions
More informationCOMP4418 Knowledge Representation and Reasoning
COMP4418 Knowledge Representation and Reasoning Week 3 Practical Reasoning David Rajaratnam Click to edit Present s Name Practical Reasoning - My Interests Cognitive Robotics. Connect high level cognition
More informationMulti-paradigm Declarative Languages
Michael Hanus (CAU Kiel) Multi-paradigm Declarative Languages ICLP 2007 1 Multi-paradigm Declarative Languages Michael Hanus Christian-Albrechts-University of Kiel Programming Languages and Compiler Construction
More informationKnowledge Representation and Reasoning Logics for Artificial Intelligence
Knowledge Representation and Reasoning Logics for Artificial Intelligence Stuart C. Shapiro Department of Computer Science and Engineering and Center for Cognitive Science University at Buffalo, The State
More informationAbduction in Logic Programming
Abduction in Logic Programming Marc Denecker 1 and Antonis Kakas 2 1 Department of Computer Science, K.U.Leuven, Celestijnenlaan 200A, B-3001 Heverlee, Belgium. Marc.Denecker@cs.kuleuven.ac.be http://www.cs.kuleuven.ac.be/~marcd
More informationPart I Logic programming paradigm
Part I Logic programming paradigm 1 Logic programming and pure Prolog 1.1 Introduction 3 1.2 Syntax 4 1.3 The meaning of a program 7 1.4 Computing with equations 9 1.5 Prolog: the first steps 15 1.6 Two
More informationNonmonotonic Databases and Epistemic Queries*
Nonmonotonic Databases and Epistemic Queries* Vladimir Lifschitz Department of Computer Sciences and Department of Philosophy University of Texas at Austin Austin, TX 78712, U. S. A. Abstract The approach
More informationKnowledge Representation and Reasoning Logics for Artificial Intelligence
Knowledge Representation and Reasoning Logics for Artificial Intelligence Stuart C. Shapiro Department of Computer Science and Engineering and Center for Cognitive Science University at Buffalo, The State
More informationData Integration: Logic Query Languages
Data Integration: Logic Query Languages Jan Chomicki University at Buffalo Datalog Datalog A logic language Datalog programs consist of logical facts and rules Datalog is a subset of Prolog (no data structures)
More informationBoolean Reasoning. The Logic of Boolean Equations. Frank Markham Brown Air Force Institute of Technology
Boolean Reasoning The Logic of Boolean Equations by Frank Markham Brown Air Force Institute of Technology ff Kluwer Academic Publishers Boston/Dordrecht/London Contents Preface Two Logical Languages Boolean
More informationUniform Proofs and Disjunctive Logic Programming y Gopalan Nadathur z and Donald W. Loveland Department of Computer Science Duke University Box
CS-1994-40 Uniform Proofs and Disjunctive Logic Programming Gopalan Nadathur Donald W. Loveland Department of Computer Science Duke University Durham, North Carolina 27708{0129 December 1994 Uniform Proofs
More informationThe CIFF Proof Procedure for Abductive Logic Programming with Constraints
The CIFF Proof Procedure for Abductive Logic Programming with Constraints U. Endriss 1, P. Mancarella 2, F. Sadri 1, G. Terreni 2, and F. Toni 1,2 1 Department of Computing, Imperial College London Email:
More informationAn Implementation of the Language Lambda Prolog Organized around Higher-Order Pattern Unification
An Implementation of the Language Lambda Prolog Organized around Higher-Order Pattern Unification SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL OF THE UNIVERSITY OF MINNESOTA BY Xiaochu Qi IN PARTIAL
More informationEXTENSIONS OF FIRST ORDER LOGIC
EXTENSIONS OF FIRST ORDER LOGIC Maria Manzano University of Barcelona CAMBRIDGE UNIVERSITY PRESS Table of contents PREFACE xv CHAPTER I: STANDARD SECOND ORDER LOGIC. 1 1.- Introduction. 1 1.1. General
More informationSAT solver of Howe & King as a logic program
SAT solver of Howe & King as a logic program W lodzimierz Drabent June 6, 2011 Howe and King [HK11b, HK11a] presented a SAT solver which is an elegant and concise Prolog program of 22 lines. It is not
More informationKnowledge Representation
Knowledge Representation References Rich and Knight, Artificial Intelligence, 2nd ed. McGraw-Hill, 1991 Russell and Norvig, Artificial Intelligence: A modern approach, 2nd ed. Prentice Hall, 2003 Outline
More informationOperational Semantics
15-819K: Logic Programming Lecture 4 Operational Semantics Frank Pfenning September 7, 2006 In this lecture we begin in the quest to formally capture the operational semantics in order to prove properties
More informationTowards a Logical Reconstruction of Relational Database Theory
Towards a Logical Reconstruction of Relational Database Theory On Conceptual Modelling, Lecture Notes in Computer Science. 1984 Raymond Reiter Summary by C. Rey November 27, 2008-1 / 63 Foreword DB: 2
More informationThe Metalanguage λprolog and Its Implementation
The Metalanguage λprolog and Its Implementation Gopalan Nadathur Computer Science Department University of Minnesota (currently visiting INRIA and LIX) 1 The Role of Metalanguages Many computational tasks
More informationLogic Programming and Resolution Lecture notes for INF3170/4171
Logic Programming and Resolution Lecture notes for INF3170/4171 Leif Harald Karlsen Autumn 2015 1 Introduction This note will explain the connection between logic and computer programming using Horn Clauses
More informationIntroductory logic and sets for Computer scientists
Introductory logic and sets for Computer scientists Nimal Nissanke University of Reading ADDISON WESLEY LONGMAN Harlow, England II Reading, Massachusetts Menlo Park, California New York Don Mills, Ontario
More informationInterpreting Abduction in CLP
Interpreting Abduction in CLP M. Gavanelli 1, E. Lamma 1, P. Mello 2, M. Milano 2, and P. Torroni 2 1 Dip. di Ingegneria, Università di Ferrara Via Saragat 1, 44100 Ferrara, Italy {mgavanelli, elamma}@ing.unife.it
More informationAbstract Logic Programming
15-819K: Logic Programming Lecture 13 Abstract Logic Programming Frank Pfenning October 10, 2006 In this lecture we discuss general criteria to judge whether a logic or a fragment of it can be considered
More informationAn Experimental CLP Platform for Integrity Constraints and Abduction
An Experimental CLP Platform for Integrity Constraints and Abduction Slim Abdennadher ½ and Henning Christiansen ¾ ½ ¾ Computer Science Department, University of Munich Oettingenstr. 67, 80538 München,
More informationProgramming Systems in Artificial Intelligence Introduction
Click to add Text Programming Systems in Artificial Intelligence Introduction Siegfried Nijssen 23/02/16 Discover thediscover world at the Leiden world University at Leiden University Programming Paradigms
More informationFunctional Logic Programming. Kristjan Vedel
Functional Logic Programming Kristjan Vedel Imperative vs Declarative Algorithm = Logic + Control Imperative How? Explicit Control Sequences of commands for the computer to execute Declarative What? Implicit
More informationChoice Logic Programs and Nash Equilibria in Strategic Games
Choice Logic Programs and Nash Equilibria in Strategic Games Marina De Vos and Dirk Vermeir Dept. of Computer Science Free University of Brussels, VUB Pleinlaan 2, Brussels 1050, Belgium Tel: +32 2 6293308
More informationModal Logic ALEXANDER CHAGROV. Tver State University. and MICHAEL ZAKHARYASCHEV
Modal Logic ALEXANDER CHAGROV Tver State University and MICHAEL ZAKHARYASCHEV Moscow State University and Institute of Applied Mathematics Russian Academy of Sciences CLARENDON PRESS OXFORD 1997 CONTENTS
More informationInfinite Derivations as Failures
Infinite Derivations as Failures Andrea Corradi and Federico Frassetto DIBRIS, Università di Genova, Italy name.surname@dibris.unige.it Abstract. When operating on cyclic data, programmers have to take
More informationSTABILITY AND PARADOX IN ALGORITHMIC LOGIC
STABILITY AND PARADOX IN ALGORITHMIC LOGIC WAYNE AITKEN, JEFFREY A. BARRETT Abstract. Algorithmic logic is the logic of basic statements concerning algorithms and the algorithmic rules of deduction between
More informationLecture 17 of 41. Clausal (Conjunctive Normal) Form and Resolution Techniques
Lecture 17 of 41 Clausal (Conjunctive Normal) Form and Resolution Techniques Wednesday, 29 September 2004 William H. Hsu, KSU http://www.kddresearch.org http://www.cis.ksu.edu/~bhsu Reading: Chapter 9,
More informationAn Abductive Framework for General Logic Programs and other Nonmonotonic Systems
An Abductive Framework for General Logic Programs and other Nonmonotonic Systems Gerhard Brewka Kurt Konolige GMD, Postfach 12 40 SRI International 5205 Sankt Augustin, Germany 333 Ravenswood Ave Menlo
More informationBuilding a Knowledge Base System for an integration of Logic Programming and Classical Logic
Building a Knowledge Base System for an integration of Logic Programming and Classical Logic Marc Denecker and Joost Vennekens Department Computer Science, Katholieke Universiteit Leuven Celestijnenlaan
More informationPARSIFAL Summer 2011 Internship Report Logically validating logic programs
PARSIFAL Summer 2011 Internship Report Logically validating logic programs Chris Martens August 22, 2011 1 Overview Logic programs can be used to specify systems, and logic programming languages such as
More information3.4 Deduction and Evaluation: Tools Conditional-Equational Logic
3.4 Deduction and Evaluation: Tools 3.4.1 Conditional-Equational Logic The general definition of a formal specification from above was based on the existence of a precisely defined semantics for the syntax
More informationImplementation of Axiomatic Language
Implementation of Axiomatic Language Walter W. Wilson 1 1 Dept. of Computer Science & Engineering The University of Texas at Arlington Arlington, Texas 76019, USA wwwilson@acm.org Abstract This report
More informationModule 6. Knowledge Representation and Logic (First Order Logic) Version 2 CSE IIT, Kharagpur
Module 6 Knowledge Representation and Logic (First Order Logic) 6.1 Instructional Objective Students should understand the advantages of first order logic as a knowledge representation language Students
More informationLogik für Informatiker Logic for computer scientists
Logik für Informatiker for computer scientists WiSe 2011/12 Overview Motivation Why is logic needed in computer science? The LPL book and software Scheinkriterien Why is logic needed in computer science?
More informationTyped Lambda Calculus
Department of Linguistics Ohio State University Sept. 8, 2016 The Two Sides of A typed lambda calculus (TLC) can be viewed in two complementary ways: model-theoretically, as a system of notation for functions
More informationChapter 2 & 3: Representations & Reasoning Systems (2.2)
Chapter 2 & 3: A Representation & Reasoning System & Using Definite Knowledge Representations & Reasoning Systems (RRS) (2.2) Simplifying Assumptions of the Initial RRS (2.3) Datalog (2.4) Semantics (2.5)
More informationDescription Logics Reasoning Algorithms Concluding Remarks References. DL Reasoning. Stasinos Konstantopoulos. IIT, NCSR Demokritos
Stasinos Konstantopoulos 10-3-2006 Overview Description Logics Definitions Some Family Members Reasoning Algorithms Introduction Resolution Calculus Tableau Calculus Concluding Remarks Definitions The
More informationPreferred Arguments are Harder to Compute than Stable Extensions
Preferred Arguments are Harder to Compute than Stable Extensions Yannis Dimopoulos Bernhard Nebel Francesca Toni University of Cyprus Universitat Freiburg Imperial College Dept. of Computer Science Institut
More informationIntegration of abductive reasoning and constraint optimization in SCIFF
Integration of abductive reasoning and constraint optimization in SCIFF Marco Gavanelli, Marco Alberti, and Evelina Lamma ENDIF, University of Ferrara, CENTRIA, Universidade Nova de Lisboa, WWW: http://www.ing.unife.it/docenti/marcogavanelli
More informationConstructive negation with the well-founded semantics for CLP
Constructive negation with the well-founded semantics for CLP Włodek Drabent Institute of Computer Science Polish Academy of Sciences, Warszawa, and IDA, Linköping University Jan Maluszynski, Jakob Henriksson
More informationConstructive Coherent Translation of Propositional Logic
Constructive Coherent Translation of Propositional Logic JRFisher@cpp.edu (started: 2009, latest: January 18, 2016) Abstract Propositional theories are translated to coherent logic rules using what are
More informationAbella: A System for Reasoning about Relational Specifications
Abella: A System for Reasoning about Relational Specifications David Baelde, Kaustuv Chaudhuri, Andrew Gacek, Dale Miller, Gopalan Nadathur, Alwen Tiu, Yuting Wang To cite this version: David Baelde, Kaustuv
More informationBaby Steps Toward an Implementation of Axiomatic Language
Baby Steps Toward an Implementation of Axiomatic Language Extended Abstract Walter W. Wilson Lockheed Martin, P.O. Box 748, Fort Worth TX 76101, USA wwwilson@acm.org Abstract. This paper describes an initial
More informationSafe Stratified Datalog With Integer Order Does not Have Syntax
Safe Stratified Datalog With Integer Order Does not Have Syntax Alexei P. Stolboushkin Department of Mathematics UCLA Los Angeles, CA 90024-1555 aps@math.ucla.edu Michael A. Taitslin Department of Computer
More informationPropositional Calculus: Boolean Algebra and Simplification. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson
Propositional Calculus: Boolean Algebra and Simplification CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus Topics Motivation: Simplifying Conditional Expressions
More informationDiagnosis through constrain propagation and dependency recording. 2 ATMS for dependency recording
Diagnosis through constrain propagation and dependency recording 2 ATMS for dependency recording Fundamentals of Truth Maintenance Systems, TMS Motivation (de Kleer): for most search tasks, there is a
More informationUnderstanding SPKI/SDSI Using First-Order Logic
Noname manuscript No. (will be inserted by the editor) Understanding SPKI/SDSI Using First-Order Logic Ninghui Li 1 John C. Mitchell 2 1 Department of Computer Sciences & Center for Education and Research
More informationResolution (14A) Young W. Lim 6/14/14
Copyright (c) 2013-2014. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free
More informationContents. Chapter 1 SPECIFYING SYNTAX 1
Contents Chapter 1 SPECIFYING SYNTAX 1 1.1 GRAMMARS AND BNF 2 Context-Free Grammars 4 Context-Sensitive Grammars 8 Exercises 8 1.2 THE PROGRAMMING LANGUAGE WREN 10 Ambiguity 12 Context Constraints in Wren
More informationAbella: A System for Reasoning about Relational Specifications
Abella: A System for Reasoning about Relational Specifications DAVID BAELDE LSV, ENS Cachan, France ANDREW GACEK Rockwell Collins, USA GOPALAN NADATHUR University of Minnesota, USA YUTING WANG University
More informationComputing Stable Models By Using the ATMS
From: AAAI-90 Proceedings. Copyright 1990, AAAI (www.aaai.org). All rights reserved. Computing Stable Models By Using the ATMS Kave Eshghi Hewlett Packard Laboratories, Filton Road, Stoke Gifford, Bristol
More informationLogic (or Declarative) Programming Foundations: Prolog. Overview [1]
Logic (or Declarative) Programming Foundations: Prolog In Text: Chapter 12 Formal logic Logic programming Prolog Overview [1] N. Meng, S. Arthur 2 1 Logic Programming To express programs in a form of symbolic
More informationMATHEMATICAL STRUCTURES FOR COMPUTER SCIENCE
MATHEMATICAL STRUCTURES FOR COMPUTER SCIENCE A Modern Approach to Discrete Mathematics SIXTH EDITION Judith L. Gersting University of Hawaii at Hilo W. H. Freeman and Company New York Preface Note to the
More informationElf: A Meta-Language for Deductive Systems (System Description)
Elf: A Meta-Language for Deductive Systems (System Description) Frank Pfenning Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, U.S.A. 1 Overview Elf is a uniform meta-language
More informationGraph Representation of Declarative Languages as a Variant of Future Formal Specification Language
Economy Informatics, vol. 9, no. 1/2009 13 Graph Representation of Declarative Languages as a Variant of Future Formal Specification Language Ian ORLOVSKI Technical University of Moldova, Chisinau, Moldova
More informationChapter 16. Logic Programming Languages
Chapter 16 Logic Programming Languages Chapter 16 Topics Introduction A Brief Introduction to Predicate Calculus Predicate Calculus and Proving Theorems An Overview of Logic Programming The Origins of
More informationFoundational Aspects of Syntax 1
Foundational Aspects of Syntax 1 Introduction Dale Miller and Catuscia Palamidessi Department of Computer Science and Engineering The Pennsylvania State University 220 Pond Laboratory University Park,
More informationPropositional Logic. Part I
Part I Propositional Logic 1 Classical Logic and the Material Conditional 1.1 Introduction 1.1.1 The first purpose of this chapter is to review classical propositional logic, including semantic tableaux.
More information15-819M: Data, Code, Decisions
15-819M: Data, Code, Decisions 08: First-Order Logic André Platzer aplatzer@cs.cmu.edu Carnegie Mellon University, Pittsburgh, PA André Platzer (CMU) 15-819M/08: Data, Code, Decisions 1 / 40 Outline 1
More informationThe Logic Paradigm. Joseph Spring. 7COM1023 Programming Paradigms
The Logic Paradigm Joseph Spring 7COM1023 Programming Paradigms 1 Discussion The Logic Paradigm Propositional and Predicate Logic See also notes and slides on PP website Horn Clauses Definition, Examples
More informationForcing in disjunctive logic programs
Forcing in disjunctive logic programs Marina De Vos Free University of Brussels, VUB marinadv@tinf1vubacbe Dirk Vermeir Free University of Brussels, VUB dvermeir@vubacbe Abstract We propose a semantics
More informationCSC 501 Semantics of Programming Languages
CSC 501 Semantics of Programming Languages Subtitle: An Introduction to Formal Methods. Instructor: Dr. Lutz Hamel Email: hamel@cs.uri.edu Office: Tyler, Rm 251 Books There are no required books in this
More information20 years of Transaction Logic
ICLP 2013 1/34 20 years of Transaction Logic Michael Kifer August 28, 2013 ICLP 2013 2/34 Outline How it all began What is Transaction Logic? What s wrong with Prolog? Transaction Logic basics Later developments
More informationIn Praise of Impredicativity: A Contribution to the Formalisation of Meta-Programming
In Praise of Impredicativity: A Contribution to the Formalisation of Meta-Programming François Bry 21 September 2017 1 / 16 Content 1 Introduction 2 Related Work 3 Meta-Programming and Higher-Order Logics
More information2. Example Rational Number Datatype
Equality for Prolog William A. Kornfeld MIT Artificial Intelligence Laboratory 545 Technology Square Cambridge, Massachusetts 02139 U.S.A. telephone: (617) 492 6172 arpanet: BAK MIT-MC Abstract The language
More information1. true / false By a compiler we mean a program that translates to code that will run natively on some machine.
1. true / false By a compiler we mean a program that translates to code that will run natively on some machine. 2. true / false ML can be compiled. 3. true / false FORTRAN can reasonably be considered
More informationInstitute for Research in Cognitive Science
, Institute for Research in Cognitive Science Representing Scope in Intuitionistic Deductions Matthew Stone University of Pennsylvania 3401 Walnut Street, Suite 400A Philadelphia, PA 19104-6228 August
More informationFOUNDATIONS OF SEMANTIC WEB TECHNOLOGIES
FOUNDATIONS OF SEMANTIC WEB TECHNOLOGIES RDFS Rule-based Reasoning Sebastian Rudolph Dresden, 16 April 2013 Content Overview & XML 9 APR DS2 Hypertableau II 7 JUN DS5 Introduction into RDF 9 APR DS3 Tutorial
More informationSpecifying and Implementing Theorem Provers in a Higher-Order Logic Programming Language
Specifying and Implementing Theorem Provers in a Higher-Order Logic Programming Language Amy P. Felty A dissertation in Computer and Information Science Presented to the Faculties of the University of
More informationAxioms: Semantics Aspects of C++ Concepts
Doc no: N2887=09-0077 Date: 2009-06-21 Project: ISO/IEC JTC1/SC22/WG21 Reply-To: Gabriel Dos Reis gdr@cs.tamu.edu Axioms: Semantics Aspects of C++ Concepts Gabriel Dos Reis Bjarne Stroustrup Alisdair Meredith
More informationLecture 4: January 12, 2015
32002: AI (First Order Predicate Logic, Interpretation and Inferences) Spring 2015 Lecturer: K.R. Chowdhary Lecture 4: January 12, 2015 : Professor of CS (VF) Disclaimer: These notes have not been subjected
More informationA Pearl on SAT Solving in Prolog (extended abstract)
A Pearl on SAT Solving in Prolog (extended abstract) Jacob M. Howe and Andy King 1 Introduction The Boolean satisfiability problem, SAT, is of continuing interest because a variety of problems are naturally
More informationAbstractions in Logic Programs
University of Pennsylvania ScholarlyCommons Technical Reports (CIS) Department of Computer & Information Science May 1989 Abstractions in Logic Programs Dale Miller University of Pennsylvania Follow this
More informationEncryption as an Abstract Datatype:
June 2003 1/18 Outline Encryption as an Abstract Datatype: an extended abstract Dale Miller INRIA/Futurs/Saclay and École polytechnique 1. Security protocols specified using multisets rewriting. 2. Eigenvariables
More informationLabelled Variables in Logic Programming: A First Prototype in tuprolog
Labelled Variables in Logic Programming: A First Prototype in tuprolog Roberta Calegari, Enrico Denti, and Andrea Omicini Dipartimento di Informatica, Scienza e Ingegneria (DISI) Alma Mater Studiorum Università
More informationA NETWORK OF COMMUNICATING LOGIC PROGRAMS AND ITS SEMANTICS. Susumu Yamasaki. Department of Information Science, Kyoto University Sakyo, Kyoto, Japan
A NETWORK OF COMMUNICATING LOGIC PROGRAMS AND ITS SEMANTICS Susumu Yamasaki Department of Information Science, Kyoto University Sakyo, Kyoto, Japan ABSTRACT In this paper, a network of communicating loqic
More informationChapter 9: Constraint Logic Programming
9. Constraint Logic Programming 9-1 Deductive Databases and Logic Programming (Winter 2007/2008) Chapter 9: Constraint Logic Programming Introduction, Examples Basic Query Evaluation Finite Domain Constraint
More informationMulti-Paradigm Programming
ETAPS 2000 Multi-Paradigm Programming Michael Hanus Christian-Albrechts-Universität Kiel Extend functional languages with features for ➀ logic (constraint) programming ➁ object-oriented programming ➂ concurrent
More informationProgramming Languages Third Edition
Programming Languages Third Edition Chapter 12 Formal Semantics Objectives Become familiar with a sample small language for the purpose of semantic specification Understand operational semantics Understand
More informationPropositional Theories are Strongly Equivalent to Logic Programs
Under consideration for publication in Theory and Practice of Logic Programming 1 Propositional Theories are Strongly Equivalent to Logic Programs Pedro Cabalar Department of Computer Science, University
More informationMulti Domain Logic and its Applications to SAT
Multi Domain Logic and its Applications to SAT Tudor Jebelean RISC Linz, Austria Tudor.Jebelean@risc.uni-linz.ac.at Gábor Kusper Eszterházy Károly College gkusper@aries.ektf.hu Abstract We describe a new
More informationDepartment of Computing Imperial College of Science and Technology 180 Queen s Gate London SW7 2BZ
INTEGRITY CHECKING IN DEDUCTIVE DATABASES Robert Kowalski Fariba Sadri Paul Soper Department of Computing Imperial College of Science and Technology 180 Queen s Gate London SW7 2BZ We describe the theory
More informationLINEAR LOGIC AS A FRAMEWORK FOR SPECIFYING SEQUENT CALCULUS
LINEAR LOGIC AS A FRAMEWORK FOR SPECIFYING SEQUENT CALCULUS DALE MILLER AND ELAINE PIMENTEL Abstract In recent years, intuitionistic logic and type systems have been used in numerous computational systems
More informationLecture Notes on Prolog
Lecture Notes on Prolog 15-317: Constructive Logic Frank Pfenning Lecture 14 October 15, 2009 In this lecture we introduce some simple data structures such as lists, and simple algorithms on them such
More informationPROPOSITIONAL LOGIC (2)
PROPOSITIONAL LOGIC (2) based on Huth & Ruan Logic in Computer Science: Modelling and Reasoning about Systems Cambridge University Press, 2004 Russell & Norvig Artificial Intelligence: A Modern Approach
More informationAn Overview of Lambda-Prolog
University of Pennsylvania ScholarlyCommons Technical Reports (CIS) Department of Computer & Information Science June 1988 An Overview of Lambda-Prolog Gopalan Nadathur Duke University Dale Miller University
More informationAdvanced Techniques for Logic Program Specialisation
Advanced Techniques for Logic Program Specialisation Michael Leuschel Department of Computer Science, K.U.Leuven Abstract Program specialisation, also called partial evaluation or partial deduction, is
More information