This directory is created automatically and some papers may be mislabeled. Only document within the CiteSeer database are listed. The directory is intended to provide entry points for browsing the database and is not intended to be authoritative. Papers may not appear in all relevant categories. For example, papers in a sub-category may not appear in higher level categories.
12891.7 Rewrite Systems - Dershowitz, Jouannaud (1990)(Correct)
Completion Completion has recently been put in a more abstract framework [ Bachmair-et al, 1986 ] , an approach we adopt here. As in traditional proof theory (cf. [ Takeuti, 1987 ] ), proofs are reduc... / Dershowitz within the logic programming paradigm. Rewriting methods br t roe Recent proposals for logic programming languages incorporating
11829.4 An Overview of Nonmonotonic Reasoning and Logic Programming - Minker (1993)(Correct)
The focus of this paper is nonmonotonic reasoning as it relates to logic programming. I discuss the pre-history of nonmonotonic reasoning starting from approximately 1958. I then review the research t... / Nonmonotonic Reasoning and Logic Programming Jack Minker br reasoning as it relates to logic programming. I discuss the pre-history
11614.5 Data-parallel Implementation of Prolog - Bevemyr (1996)(Correct)
Bevemyr, J. 1996: Data-parallel Implementation of Prolog, Uppsala Theses in
Computing Science 25. 38 pp. Uppsala. ISSN 0283--359X, ISBN 91--506--1177--1.
Parallel computers are rarely used to make ind... / In Proc. th Int. Conf. Logic programming MIT Press . II. Johan br Technology for Constraint Logic Programming Languages . V. Jonas
11579.3 Higher Order Logic - Leivant (1994)(Correct)
Contents
1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2
2 The expressive power of second order Logic : : : : : : : : : : : 3
2.1 The language of second order logic : : : : :... / between higher order logic and programming and computing the use of br More recently extensions of logic programming with higher order
9715.8 The Role of Abduction in Logic Programming - Kakas, Kowalski, Toni (1998)(Correct)
This paper is a survey and critical overview of recent work on the extension of Logic Programming
to perform Abductive Reasoning (Abductive Logic Programming). It updates
the earlier paper "Abductive ... / The Role of Abduction in Logic Programming A.C. Kakas br work on the extension of Logic Programming to perform Abductive
9544.3 Knowledge Representation with Logic Programs - Gerhard Brewka, Jürgen Dix (1997)(Correct)
In this tutorial-overview we show how Knowledge Representation
(KR) can be done with the help of generalized logic programs. We start
by introducing the core of PROLOG, which is based on definite logi... / combinations of ideas from logic programming and nonmonotonic reasoning br have been considered in the logic programming community for more than
9292.6 Proof-search in Type-theoretic Languages: An Introduction - Galmiche, Pym (2000)(Correct)
We introduce the main concepts and problems in the theory of proof-search in
type-theoretic languages and survey some specific, connected topics. We do not claim
to cover all of the theoretical and im... / approaches to the semantics of logic programming with type-theoretic br model of computation like logic programming. Representation in
9231.8 Autoepistemic Logic As A Unified Basis For Nonmonotonic Reasoning - Niemelä (1993)(Correct)
Autoepistemic logic is investigated in a general setting where autoepistemic reasoning based on a given classical logic is studied. The possible sets of autoepistemic conclusions from a set of premise... / assumption is used logic programming where the negation as br semantics. On the other hand logic programming based on the stable model
9081.9 Agents in Logic Programming - Quintero (1997)(Correct)
The objective of this thesis is to explore ways of describing agents in logical theories.
The contribution is that the logical theories we build are a generalised form of logic programs.
Like normal l... / Agents in Logic Programming Jacinto Alfonso D'avila br models of agents. Four logic programming languages to program agent
8981.5 A Survey on Complexity Results for Non-monotonic Logics - Cadoli, Schaerf (1993)(Correct)
This paper surveys the main results appeared in the literature on the computational
complexity of non-monotonic inference tasks. We not only give results
about the tractability/intractability of the i... / whose relations with logic programming are clear and well studied. br and negation as failure in logic programming have been defined with the
8851.4 Compilation Techniques for Prolog - Lindgren (1996)(Correct)
Lindgren, T. 1996: Compilation Techniques for Prolog, Uppsala Theses in Computing
Science 26. 36pp. Uppsala. ISSN 0283-359X, ISBN 91-506-1181-X.
Current Prolog compilers are largely limited to optimiz... / implementations of logic programming language today. We show that br many of the premier people in logic programming. In particular I would like
7902.4 Software Development Environment Based on Object-Oriented and Logic.. - Khaled Fouad Sayed Shaalan (1995)(Correct)
S
oftware development environments are essential in today's world of growing
software systems. Software development environment increases the productivity
of software by providing better languages an... / Based on Object-Oriented and Logic Programming Paradigms Khaled Fouad br recent research in concurrent logic programming paradigm is directed towards
7812.5 Constraint Programming - Group (1996)(Correct)
Machine, which has proven extremely successful in the context of logic
programming. The WAM approach essentially provides a view of the compilation
of these languages as a generalization of the standa... / constructs e.g.constraint logic programming CLP or concurrent br clause subset that underly logic programming which are usually efficient
7747.9 Uniprocessor Garbage Collection Techniques - Wilson (1992)(Correct)
We survey basic garbage collection algorithms, and variations such as incremental and generational collection; we then discuss low-level implementation considerations and the relationships between sto... / such as functional or logic programming languages. For further br programming. Functional and logic programming languages generally
7526.2 A Survey of Research on Deductive Database Systems - Ramakrishnan, Ullman (1993)(Correct)
The area of deductive databases has matured in recent years, and it now seems appropriate to reflect
upon what has been achieved and what the future holds. In this paper, we provide an overview of the... / theorem proving and later logic programming. In an interesting survey of br of Deductive Databases and Logic Programming pages - .
7275.8 Logic-based Knowledge Representation - Baader (1997)(Correct)
After a short analysis of the requirements that a knowledge representation
language must satisfy, we introduce Description Logics,
Modal Logics, and Nonmonotonic Logics as formalisms for representing,... / comment on the connection to Logic Programming. Introduction Let us br firstorder predicate logic. Logic Programming languages as indicated by
7252.2 Proof Systems for Nonmonotonic Logics - Niemelä, Schwind (1994)(Correct)
A survey of proof systems for nonmonotonic logics is presented. In particular,
proof methods for default logics, nonmonotonic modal logics, circumscription,
and conditional logics are discussed.
1 Int... / assumption is used logic programming where the negation as br Conference and Symposium on Logic Programming Washington D.C.USA
7060.2 The Design And Implementation Of Massively Parallel Knowledge.. - Mani (1995)(Correct)
Efficient knowledge representation and reasoning is an important component of intelligent activity,
and is a crucial aspect in the design of large-scale intelligent systems. This dissertation
explores... / . Parallel Logic Programming br . . Parallel Logic Programming Languages
6633.4 Efficient Bottom-Up Evaluation Of Logic Programs - Ramakrishnan, Srivastava, Sudarshan (1992)(Correct)
In recent years, much work has been directed towards evaluating logic programs
and queries on deductive databases by using an iterative bottom-up fixpoint computation.
The resulting techniques offer... / of extensions to the standard logic programming paradigm. We present the br database query evaluation and logic programming evaluation and then
6600.6 Applications of Linear Logic to Computation: An Overview - Alexiev (1993)(Correct)
This paper is an overview of existing applications of Linear Logic (LL) to issues of computation. After a substantial introduction to LL, it discusses the implications of LL to functional programming,... / LL to functional programming logic programming concurrent and br functional programming logic programming concurrent and
6347.8 Distributing And- and Or-Work in the Andorra-I Parallel Logic.. - Dutra (1995)(Correct)
Parallelism and logic programming are two fi elds that have been successfully combined,
as is shown by recent implementations of parallel logic programming systems. There
are two main sources of paral... / in the Andorra-I Parallel Logic Programming System In es de Castro br Abstract Parallelism and logic programming are two fi elds that have
6343.8 Survey: Practical Applications of Constraint Programming - Wallace (1995)(Correct)
no abstract-- unknown Survey: Practical Applications of Constraint
Programming
Mark Wallace
IC-Parc, William Penney Laboratory,
Imperial College, LONDON SW7 2AZ.
email: mgw@doc.ic.ac.uk
September 1... / and other purer functional and logic programming languages and of course it br point of view the extension of logic programming to Constraint Logic
6295.5 S-Semantics Approach: Theory And Applications - Bossi, Gabbrielli, Levi, Martelli (1994)(Correct)
The paper is a general overview of an approach to the semantics of logic
programs whose aim is finding notions of models which really capture the
operational semantics, and are therefore useful for de... / According to a popular view of logic programming the problem of the br for all by logicians before logic programming was even born. Namely the
6294.2 Rule-Based Languages - Vianu (1996)(Correct)
The paper presents a survey of the main formal rule-based languages and semantics.
Both procedural (fixpoint) and declarative (model-theoretic) semantics are defined and
discussed, including inflation... / which we shall call the logic programming approach attempts to br a perfect marriage between the logic programming and Work supported in
6155.9 Analysis and Transformation of Proof Procedures - de Waal (1994)(Correct)
Automated theorem proving has made great progress during the last few decades. Proofs
of more and more difficult theorems are being found faster and faster. However, the exponential
increase in the si... / . Meta-Programming in Logic Programming br language L we use a logic programming language in this thesis
6112.0 1983-1993: The Wonder Years of Sequential Prolog Implementation - Van Roy (1993)(Correct)
This report surveys the major developments in sequential Prolog implementation during the
period 1983--1993. In this decade, implementation technology has matured to such a degree
that Prolog has left... / to appear in the Journal of Logic Programming tenth anniversary issue br Implementation Prolog logic programming WAM Warren Abstract
5950.9 Explaining Reasoning In Description Logics - McGuinness (1996)(Correct)
OF THE DISSERTATION
EXPLAINING REASONING IN DESCRIPTION
LOGICS
by Deborah L. McGuinness
Dissertation Director: Alexander Borgida
Knowledge-based systems, like other software systems, need to be debugg... / ix . . Explanation in Logic Programming . br on explaining expert systems logic programming deductive databases
5778.3 Logic Program Synthesis - Deville, Lau (1993)(Correct)
This paper presents an overview and a survey of logic program synthesis.
Logic program synthesis is interpreted here in a broad way; it is concerned
with the following question: given a specification,... / J. Logic Programming - Logic br satisfying the specification Logic programming provides a uniquely nice
5748.3 Access-Limited Logic - A Language for Knowledge Representation - Crawford (1990)(Correct)
Access-Limited Logic (ALL) is a language for knowledge representation which formalizes the access
limitations inherent in a network structured knowledge-base. Where a deductive method such as
resoluti... / Some Results From the Study of Logic Programming br classical deductive method or logic programming language would retrieve all
5700.2 CHIC - Final Technical Report - (Ed.) (1995)(Correct)
This documents provides an overview on the CHIC project. It describes its structure and summarizes its main objectives. A summary of the applications developed in the project is following showing the ... / applicability of constraint logic programming. Based on the experience br e the new constraint logic programming platform developed in the
5672.3 Transaction Logic Programming (or, A Logic of Procedural and.. - Bonner, Kifer (1995)(Correct)
An extension of predicate logic, called Transaction Logic, is proposed, which accounts
in a clean and declarative fashion for the phenomenon of state changes in logic programs
and databases. Transacti... / Transaction Logic Programming or A Logic of br applications to Databases and Logic Programming we also discuss
5568.1 Disjunctive Datalog - Eiter, Gottlob, Mannila (1997)(Correct)
We consider disjunctive datalog, a powerful database query language based on disjunctive logic programming. Briefly, disjunctive datalog is a variant of datalog where disjunctions may appear in the ru... / language based on disjunctive logic programming. Briefly disjunctive br for negation in disjunctive logic programming. In particular we
5561.9 Set Constraints: a Pearl in Research on Constraints - Pacholski, Podelski (1997)(Correct)
The topic of set constraints is a pearl among the research topics
on constraints. It combines theoretical investigations (ranging from
logical expressiveness, decidability, algorithms and complexity... / set constraints in constraint logic programming. Uribe uses set br language. The Journal of Logic Programming pages - . .
5561.2 Efficient Pruning Methods for Relational Learning - Fürnkranz (1994)(Correct)
This thesis is concerned with efficient methods for achieving noise-tolerance in Machine
Learning algorithms that are capable of using relational background knowledge. While
classical algorithms are r... / the recent field of Inductive Logic Programming a new research area at the br of Machine Learning and Logic Programming. In this work we first
5540.2 Automatic Parallelization Of Prolog Programs - Sehr (1992)(Correct)
MACHINE : : : : : : : : : : : : : : : : : : : : : : 18
1.6 DATAFLOW AND DEPENDENCES : : : : : : : : : : : : : : : : : : : : : : : : 22
1.7 SOURCES OF PARALLELISM : : : : : : : : : : : : : : : : : : : ... / considerable research into logic programming languages such as Prolog. br of the North American Logic Programming Conference pages -
5536.1 A Case-Analysis Approach To Disjunctive Logic Programming - Reed (1991)(Correct)
Computer Science)
A CASE-ANALYSIS APPROACH TO
DISJUNCTIVE LOGIC PROGRAMMING
by
David W. Reed
Department of Computer Science
Duke University
Date:
Approved:
Donald W. Loveland, Supervisor
Gopalan ... / Approach to Disjunctive Logic Programming David W. Reed Department br Approach To Disjunctive Logic Programming By David W. Reed
5533.4 Partial Evaluation: Principles and Perspectives - Consel, Danvy (1993)(Correct)
The last years have witnessed a flurry of new results in
the area of partial evaluation. These tutorial notes survey
the field and present a critical assessment of the state of
the art.
1 Introduction... / languages. In the area of logic programming partial deduction is the br Language Implementation and Logic Programming volume of Lecture
5515.3 Specialization of Functional Logic Programs - Alpuente, Falaschi, Vidal(Correct)
Languages that integrate functional and logic programming with a complete operational semantics are
based on narrowing, a unification-based goal-solving mechanism which subsumes the reduction principl... / that integrate functional and logic programming with a complete operational br term-rewriting systems and logic programming. Finally we present some
5414.8 The Practice of Logical Frameworks - Frank Pfenning (1996)(Correct)
Introduction
Deductive systems, given via axioms and rules of inference, are a common conceptual
tool in mathematical logic and computer science. They are used to specify
many varieties of logics and... / Pau Pau NP and logic programming languages NM MNPS br The type-theoretic and logic programming approaches were later
5403.2 Semantic Unification for Convergent Systems - Mitra (1994)(Correct)
ing AC-goals : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 66
5.4 Transformations for non-AC goals : : : : : : : : : : : : : : : : : : : : : : : : : : 67
5.5 Transformation rules f... / of control structures Logic programming is another programming br for a survey on logic programming. Logic programs which use
5382.0 Scheduling Strategies for Evaluation of Recursive Queries over Memory .. - Silva (1997)(Correct)
of the Dissertation
Scheduling Strategies for Evaluation of Recursive Queries over Memory and Disk-Resident Data
by
Juliana Freire de Lima e Silva
Doctor of Philosophy
in
Computer Science
State Un... / extends the power of logic programming languages such as Prolog by br basis to combine the fields of logic programming and databases. iii To
5291.9 Logics for Databases and Information Systems - Chomicki, (Eds.) (1998)(Correct)
Temporal Databases 34
3.2.2 Relational Database Histories 36
3.3 Temporal Queries 36
3.3.1 Abstract Temporal Query Languages 37
3.3.2 Expressive Power 41
3.3.3 Space-efficient Encoding of Temporal Dat... / Temporal Structures . Logic Programming . . Herbrand Models br logic program logic programming logical consequence
5102.0 Generalised Constraint Propagation Over the CLP Scheme - Le Provost, Wallace (1992)(Correct)
Constraint logic programming is often described as logic programming with unification replaced
by constraint solving over a computation domain. There is another, very different,
CLP paradigm based on ... / appears in the Journal of Logic Programming ii Abstract br ii Abstract Constraint logic programming is often described as logic
5070.7 Logic Program Development Based on Typed, Moded Schemata and Data.. - Marakakis (1997)(Correct)
The main contribution of the thesis is to develop a comprehensive framework for developing
logic programs using five program schemata and some basic data types, and to evaluate its
suitability for dev... / . Paradigms in Logic Programming br of Schema-Based Methods in Logic Programming
5015.4 Formalization of the Development Process - Basin, Krieg-Brückner (1998)(Correct)
Introduction
14.1.1 What is development?
Software development encompasses many phases including requirements engineering,
specification, design, implementation, verification or testing, and
maintena... / synthesis. Journal of Logic Programming . Fea Martin br provers in a higher-order logic programming language. In th Intl.
4998.1 An Overview of Temporal and Modal Logic Programming - Orgun, Ma (1994)(Correct)
This paper presents an overview of the development of the
field of temporal and modal logic programming. We review temporal and
modal logic programming languages under three headings: (1) languages
... / of Temporal and Modal Logic Programming Mehmet A. Orgun br field of temporal and modal logic programming. We review temporal and
4917.5 Constraint Programming and Database Query Languages - Kanellakis, Goldin (1994)(Correct)
The declarative programming paradigms used in constraint
languages can lead to powerful extensions of Codd's relational data
model. The development of constraint database query languages from
logica... / the development of constraint logic programming from logic programming but br logic programming from logic programming but with the additional
4907.6 Colimit Library for Graph Transformations and Algebraic Development.. - Dietmar Wolz (1998)(Correct)
ions are defined both for objects and layers. There are several compatibility
requirements for the definition of these functions. The set of objects contains a specific
?-element which allows the sou... / semantics of functional logic programming languages CW based on br semantics of functional logic programming languages CW to
4907.5 A Hidden Agenda - Goguen, Malcolm (1997)(Correct)
This paper unveils and motivates an ambitious programme of hidden algebraic
research in software engineering, beginning with our general goals, continuing
with an overview of results, and including ... / that an entirely new style of logic programming could develop out of hidden br approach to constraint logic programming described in Note
4886.4 Theoretical Properties and Efficient Satisfaction of Hierarchical.. - Hosobe (1997)(Correct)
Constraints are recognized as powerful tools for various problems such as
management of knowledge, logic programming, and construction of graphical
user interfaces. Especially, hierarchical constraint... / as management of knowledge logic programming and construction of
4878.1 Using Multi-Strategy Learning to Improve Planning Efficiency and.. - Estlin (1998)(Correct)
viii
Chapter 1 Introduction 1
1.1 Acquiring Planning Control Knowledge . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Scope: A Control Knowledge Acquisition System . . . . . . . . . . . . . ... / with techniques from inductive logic programming. Specifically EBL is used br . . . Inductive Logic Programming .
4840.9 Hierarchical Constraint Logic Programming - Wilson (1993)(Correct)
A constraint describes a relation to be maintained unknown
Hierarchical Constraint
Logic Programming
(Ph.D. Dissertation)
Molly Ann Wilson
Dept. of Computer Science and Engineering
University of Was... / Hierarchical Constraint Logic Programming Ph.D. Dissertation br Hierarchical Constraint Logic Programming by Molly Ann Wilson
4767.6 Transaction Datalog: a Compositional Language for Transaction.. - Bonner (1997)(Correct)
In the classical model of database transactions, large transactions cannot be built
out of smaller ones. Instead, transactions are modelled as atomic and isolated units of
work. This model has been wi... / This fragment provides a logic programming language in which users can br proof procedure in the logic-programming tradition
4697.0 Reasoning About Knowledge: A Survey - Halpern (1995)(Correct)
In this survey, I attempt to identify and describe some of the common
threads that tie together work in reasoning about knowledge in such diverse fields as
philosophy, economics, linguistics, artifi... / Artificial Intelligence and Logic Programming Vol. D. Gabbay C. J.
4625.3 A Logic Programming System for Non-monotonic Reasoning - Alferes, Damásio, Pereira (1995)(Correct)
The evolution of Logic Programming semantics has included the introduction of a new
explicit form of negation, beside the older implicit (or default) negation typical of Logic
Programming. The richer ... / A Logic Programming System for Non-monotonic br Abstract The evolution of Logic Programming semantics has included the
4523.8 Feature Logics - Rounds (1994)(Correct)
Contents HANDBOOK OF LOGIC AND LANGUAGE Edited by Van Benthem & Ter Meulen c fl 1994 Elsevier Science B.V. All rights reserved 2 William C. Rounds Ch. Section 1 Feature Logics 3 1. Introduction 1.1. O... / as the control mechanism is a logic programming language. For complete br to Smolka arises from logic programming where terms are used as
4460.8 Deduction Systems Based on Resolution - Norbert Eisinger, Hans Jürgen Ohlbach (1991)(Correct)
A general theory of deduction systems is presented. The theory is illustrated with deduction
systems based on the resolution calculus, in particular with clause graphs.
This theory distinguishes four ... / in Artificial Intelligence and Logic Programming Volume I Logical br Originating from the field of logic programming and pioneered by Colmerauer
4405.6 Logic-Based Abductive Inference - Sheila A. McIlraith (1998)(Correct)
This paper surveys the work on abductive inference within the field of artificial
intelligence (AI), with particular attention to logic-based abduction. The paper
commences with a formal description o... / . . Logic Programming Framework . br a causal framework a logic programming framework and the Theorist
4370.8 Constraint Query Languages - Kanellakis, Kuper, Revesz (1990)(Correct)
We investigate the relationship between programming with constraints and database query
languages. We show that efficient, declarative database programming can be combined with
efficient constraint so... / elimination constraint logic programming relational calculus br A major recent development in logic programming systems is the integration
4364.2 Description Logics in Data Management - Borgida (1995)(Correct)
Description logics and reasoners, which are descendants of the kl-one language, have been studied in depth in Artificial Intelligence. After a brief introduction, we survey in this paper their applica... / for those familiar with logic programming Since descriptions br deduction not made in current logic programming systems. It is such
4326.1 Integrating Multiple Learning Strategies in First Order Logics - Giordana, Neri, al. (1997)(Correct)
This paper describes a representation framework, that offers a unifying platform for
alternative systems, which learn concepts in First Order Logic. The main aspects of this framework
are discussed.... / Quinlan and Inductive Logic Programming ILP Muggleton br On the contrary the Logic Programming framework adopted in ILP
4294.9 Working Within the FGCS National Project - Tick (1992)(Correct)
The Japanese Fifth Generation Computer Systems (FGCS) extending from
1982--1992 has been enshrouded in hype since its inception. The national project
made bold promises in the fields of artifical inte... / engineering and a focus on logic programming as a great success and the br in the direction of parallel logic programming languages implementation
4213.2 Toward A Foundation of Disjunctive Logic Programming - Minker (1989)(Correct)
I provide a personal memoir on work that I have done and describe research
that influenced my work that led to results in the foundation of disjunctive
logic programming. I discuss my beginning experi... / A Foundation of Disjunctive Logic Programming Jack Minker br the foundation of disjunctive logic programming. I discuss my beginning
4165.1 How to Declare an Imperative - Wadler (1995)(Correct)
How can we integrate interaction into a purely declarative language? This tutorial describes a solution to this problem based on a monad. The solution has been implemented in the functional language H... / Lloyd editor International Logic Programming Symposium MIT Press br which combines functional and logic programming. Monads have also served as
4161.3 Non-monotonic Reasoning vs. Logic Programming: A New Perspective - Przymusinski (1987)(Correct)
this paper is to present an account of these recent developments.
The paper is organized as follows. In Sections 2, 3 and 4 we briefly
discuss declarative knowledge, non-monotonic reasoning and logic ... / Non-monotonic Reasoning vs. Logic Programming A New Perspective br reasoning and the area of logic programming are of crucial and
4146.5 Deja-Vu - Distributed Hypermedia Application Framework - Eliëns(Correct)
The project Deja-Vu aims at providing a framework for the development of open heterogeneous
distributed object oriented intelligent hypermedia systems. It serves as a vehicle for research in
hypermedi... / visual languages distributed logic programming intelligent information br visual languages distributed logic programming intelligent information
4141.5 Temporal Deductive Databases - Baudinet, Chomicki, Wolper (1992)(Correct)
We survey a number of approaches to the problem of finite representation of infinite temporal extensions.
Two of them, Datalog 1S and Templog, are syntactical extensions of Datalog ; the third is base... / Keywords query processing logic programming temporal logic constraint br temporal logic constraint logic programming expressiveness
4033.0 Non-Monotonic Formalisms And Logic Programming - Przymusinski (1989)(Correct)
this paper is to discuss recent research developments, which unknown NON-MONOTONIC FORMALISMS
AND LOGIC PROGRAMMING
Teodor C. Przymusinski
The University of Texas at El Paso
teodor%utep.uucp@cs.utexa... / Non-Monotonic Formalisms And Logic Programming Teodor C. Przymusinski br me that work in databases logic programming deductive databases
3953.5 A Taste of Rewrite Systems - Dershowitz (1993)(Correct)
This survey of the theory and applications of rewriting with equations discusses the existence
and uniqueness of normal forms, the Knuth-Bendix completion procedure and its variations, as
well as re... / functional and logic programming and equational br to cover systems important in logic programming with variables in
3943.1 Logical and Operational Methods in the Analysis of Programs and.. - Nielson, Cousot, Dam, Degano..(Correct)
Interpretation [25], Modalities in Analysis and Veri cation [30], and Enhanced
Operational Semantics [35]. Each section below begins with a presentation of our
view of the state-of-the-art within the ... / concurrent functional logic-programming constraint etc. It is br editors th Int. Conf. Logic Programming. MIT Press . . J.M
3940.1 Workflows, Transactions, and Datalog - Bonner (1999)(Correct)
Transaction Datalog (abbreviated T D) is a concurrent programming language that
provides process modeling, database access, and advanced transactions. This paper
illustrates the use of T D for specify... / systems and concurrent logic programming These formalisms all br subroutine definitions in the logic-programming tradition In particular
3924.1 The State of Change: A Survey - Bonner, Kifer (1998)(Correct)
Updates are a crucial component of any database programming
language. Even the simplest database transactions, such as withdrawal
from a bank account, require updates. Unfortunately, updates are
not... / short-term practical solution logic programming languages have resorted to br those designed for database or logic programming and those designed for
3897.8 A Higher-order Calculus and Theory Abstraction - Luo (1988)(Correct)
ion Zhaohui Luo Department of Computer Science University of Edinburgh The King's Buildings Edinburgh EH9 3JZ, U.K. Abstract We present a higher-order calculus ECC which naturally combines Coquand-Hue... / the extended calculus as a programming logic for specification and br We view ECC as a core of a programming logic in whose impredicative level
3870.3 MetateM in Intensive Care - Reynolds (1997)(Correct)
We apply the MetateM executable temporal logic programming
language in a distributed system guise to a case study of a hospital
patient monitoring system. The purpose is to test MetateM
as a framewor... / MetateM executable temporal logic programming language in a distributed br below and the temporal logic programming in Abadi and Manna
3818.2 Overview of Datalog Extensions with Tuples and Sets - Liu (1998)(Correct)
Datalog (with negation) is the most powerful query language for relational database
with a well-defined declarative semantics based on the work in logic programming. However,
Datalog only allows inexp... / on Deductiveuctive and Logic Programming DDLP ' Manchester UK br semantics based on the work in logic programming. However Datalog only
3809.8 Creating Specialised Integrity Checks Through Partial Evaluation of.. - Leuschel, De Schreye (1998)(Correct)
Integrity constraints are useful for the specification of deductive databases, as well
as for inductive and abductive logic programs. Verifying integrity constraints upon
updates is a major efficiency... / as a meta-interpreter in logic programming. This meta-interpreter br the references therein and logic programming e.g.
3795.5 Inductive Logic Programming for Natural Language Processing - Raymond Mooney (1997)(Correct)
This paper reviews our recent work on applying inductive
logic programming to the construction of natural language processing
systems. We have developed a system, Chill, that learns a parser from a
... / Sixth International Inductive Logic Programming Workshop Inductive Logic br Workshop Inductive Logic Programming for Natural Language
3774.3 Proof Procedures for Logic Programming - Donald W. Loveland, Gopalan Nadathur (1994)(Correct)
Proof procedures are an essential part of logic applied to artificial intelligence tasks, and
form the basis for logic programming languages. As such, many of the chapters throughout
this handbook uti... / Proof Procedures for Logic Programming Donald W. Loveland and br May Proof Procedures for Logic Programming y Donald W. Loveland
3768.1 Planning-Based Control of Software Agents - Weld (1996)(Correct)
this paper is not intended to be a
comprehensive survey of important softbot projects ---
there are far too many interesting systems for me to
describe them all. I focus on University of Washington
pr... / planner uses principles from logic programming Jaffar et al. and
3734.5 The F(rames)-Logic Approach for Description Languages II: A Hybrid.. - Balaban (1994)(Correct)
Descriptions and Rules are different, complementary, essential forms of knowledge. Descriptions are
analytic and closed; rules are contingent and open. Historically, descriptions and rules were develo... / integrated into a first order logic programming language F rames Logic br partial orders lattices and logic programming are summarized in Appendix
3719.9 A Brief Overview of Logic Programming Research at the K.U.Leuven.. - Martens, Bruynooghe, Denecker, De..(Correct)
In this paper, we present a brief overview of most recent and ongoing research in
logic programming at the K.U.Leuven Department of Computer Science. We specifically
include some indications of its pr... / A Brief Overview of Logic Programming Research at the K.U.Leuven br and ongoing research in logic programming at the K.U.Leuven Department
3716.0 Exploiting Fine-grain Parallelism in Concurrent Constraint Languages - Montelius (1997)(Correct)
Montelius, J., 1997. Exploiting Fine-grain Parallelism in Concurrent Constraint
Languages, 220 pp. Uppsala Thesis in Computing Science 28, ISSN 0283-359X,
ISBN 91-506-1215-8. SICS Dissertation Series ... / Cache performance Logic programming Abstract machine Parallel br . Concurrent logic programming
3667.7 Logic Program Schemata: Synthesis and Analysis - Flener (1995)(Correct)
A program schema is a template program with a fixed control and data flow, but without specific indications
about the actual parameters or the actual computations. A program schema and the constraints... / I explore these issues in the logic programming framework and focus on the br programming results into the logic programming framework even though a
3602.6 Circumscribing Embedded Implications (Without Stratifications) - McCarty (1992)(Correct)
This paper is a study of circumscription, not in classical logic, as usual, but
in intuitionistic logic. We first review the intuitionistic circumscription of Horn
clause logic programs, which was dis... / To appear in Journal of Logic Programming Special Issue on Logic br Special Issue on Logic Programming and Nonmonotonic Reasoning
3577.6 Integrating ILP and EBL - Mooney, Zelle (1994)(Correct)
This paper presents a review of recent work that
integrates methods from Inductive Logic Programming
(ILP) and Explanation-Based Learning
(EBL). ILP and EBL methods have complementary
strengths and we... / methods from Inductive Logic Programming ILP and Explanation-Based br Introduction Inductive Logic Programming ILP and Explanation-Based
3568.2 An Overview of Transaction Logic - Bonner, Kifer (1994)(Correct)
This paper presents an overview of Transaction Logic---a new formalism recently
introduced in [11, 12] and designed to deal with the phenomenon of state changes in
logic programming, databases, and AI... / of state changes in logic programming databases and AI. br mind especially in databases logic programming and AI. It was therefore
3558.2 Tabled Evaluation with Delaying for General Logic Programs - Chen, Warren (1996)(Correct)
SLD resolution with negation as finite failure (SLDNF) reflects the procedural interpretation of predicate calculus as a programming language and forms the computational basis for Prolog systems. Desp... / for the next generation of logic programming systems. Contents br evaluation makes it a good logic programming strategy and its
3546.8 Semantics for Disjunctive Logic Programs with Explicit and Default.. - Minker, Ruiz (1994)(Correct)
The use of explicit negation enhances the expressive power of logic
programs by providing a natural and unambiguous way to assert negated
information about the domain being represented. We study the s... / step in the development of logic programming as an approach to the use br in the area of extended logic programming include Explicit
3543.6 Verification, Validation and Integrity Issues in Expert and Database.. - Coenen, Eaglestone, Ridley(Correct)
This paper is directed at two central objectives. The first is to identify and establish areas
of overlap between the expert and database system domains. The second is to present a view
of existing an... / is the link between Constraint Logic Programming CLP and constraint br properties to that of a logic programming environment. For example
3513.2 Predicate Invention: A Comprehensive View - Kramer(Correct)
This paper discusses predicate invention (PI) from various, previously
neglected viewpoints. First of all, we argue that predicate invention should
build on existing work on constructive induction in ... / Inductive Learning Inductive Logic Programming Abstract This paper br a new area called Inductive Logic Programming ILP Muggleton
3505.5 Learning Search-Control Heuristics for Logic Programs: Applications.. - John Zelle (1993)(Correct)
This paper presents a general framework, learning search-control heuristics for logic
programs, which can be used to improve both the efficiency and accuracy of knowledgebased
systems expressed as def... / recent advances in inductive logic programming to learn clause-selection br framework into the domain of logic programming. This proposal embraces
3496.2 Mixed Logical/Linear Programming - Hooker, Osorio (1997)(Correct)
Mixed logical/linear programming (MLLP) is an extension of mixed integer/linear programming
(MILP). It can represents the discrete elements of a problem with logical propositions
and provides a more n... / These include many of the logic programming and constraint satisfaction br continuous variables. Logic programming models introduced by
3478.8 Automatic Construction of Accurate Models of Physical Systems - Bradley, Stolle (1996)(Correct)
This paper describes an implemented computer program called pret that automates
the process of system identification: given hypotheses, observations, and specifications,
it constructs an ordinary diff... / and nonlinear regression with logic programming computer vision br intelligence techniques like logic programming and qualitative symbolic
3447.7 Well-Founded and Stationary Models of Logic Programs - Przymusinski (1994)(Correct)
Machine (XWAM) for this semantics [War89] and
developed an elegant interpreter in Prolog [CW92]. For datalog programs with negation,
the computation of well-founded models is quadratic in the size of ... / of the formal foundations of logic programming and deductive databases has br and difficult problems in logic programming and deductive databases. The
3436.8 Ramification and Causality - Thielscher (1996)(Correct)
The ramification problem in the context of commonsense reasoning about actions and
change names the challenge to accommodate actions whose execution causes indirect
effects. Not being part of the resp... / specific calculus based on the logic programming paradigm. On leave br and which employs the logic programming paradigm Holldobler and
3435.2 Super Logic Programs - Stefan Brass, Jürgen Dix, Teodor C.. (1998)(Correct)
Recent extensive research on non-monotonic reasoning and logic programming has
clearly demonstrated that logic programs are sufficiently expressive to allow formalizations
of many important problems i... / non-monotonic reasoning and logic programming has clearly demonstrated br a suitable extension of the logic programming paradigm. We argue that
3431.5 Intuitionistic Deductive Databases And The Polynomial Time Hierarchy - Bonner (1997)(Correct)
this paper, we establish more comprehensive
results by exploring the interaction of negation-as-failure with a
natural syntactic restriction called linearity. The main result is a tight
connection bet... / J. Logic Programming - br The Journal Of Logic Programming C Fl Elsevier Science
3426.0 Expressive Power of Declarative Programming Languages - Matsushita (1998)(Correct)
The thesis investigates several aspects of the expressive power of declarative programming
languages.
There seems to be no widely accepted definition of expressive power of programming
languages. In t... / counterparts of some logic programming techniques . br Workshop on Functional and Logic Programming A part of Chapter
3424.7 Constraint Query Algebras - Goldin, Kanellakis (1996)(Correct)
Constraint query languages are natural extensions of relational database query
languages. A framework for their declarative specification (constraint calculi) and efficient implementation
(low data ... / Borning and in logic programming languages Jaffar and br the development of Constraint Logic Programming CLP as a general-purpose
3416.1 Default Logic - Poole (1998)(Correct)
this paper we cannot derive g. unknown Default Logic
David Poole
Department of Computer Science,
University of British Columbia,
Vancouver, B.C., Canada V6T 1W5
(604) 228 6254
poole@cs.ubc.ca
May 14, ... / Artificial Intelligence and Logic Programming. Default Logic is br stable model semantics for logic programming. In R. Kowalski and K.
3407.5 Visions for Logic-Based Natural Language Processing - Erbach, Manandhar (1995)(Correct)
The purpose of this paper is to outline the requirements that the field of Natural Language
Processing (NLP) has for a declarative successor to Prolog. Logic programming approaches
play a major role i... / successor to Prolog. Logic programming approaches play a major br had a strong influence on logic programming Colmerauer
3392.5 The CORAL Deductive System - Ramakrishnan, Srivastava, Sudarshan, .. (1994)(Correct)
CORAL is a deductive system which supports a rich declarative language, and an interface to C++ which
allows for a combination of declarative and imperative programming. The declarative query language... / semantics with features of a logic programming language such as powerful br such as SQL and differs from logic programming languages such as Prolog in
3385.9 Representing Actions: Laws, Observations and Hypotheses - Baral, Gelfond, Provetti (1993)(Correct)
this paper we mean propositions whose truth
values depend on time) at particular moments of time. One of the central problems
of knowledge representation is the discovery of methods of representing th... / J. Logic Programming - br relation of L and use logic programming approximation of this
3384.7 A survey of parallel execution strategies for transitive closure and.. - Cacace, Ceri, Houtsma(Correct)
An important feature of database technology of the nineties is the use of parallelism for speeding
up the execution of complex queries. This technology is being tested in several experimental database... / queries and of more general logic programming queries the new dimension br within their query languages logic programming interfaces to databases will
3375.6 Efficient Constraints on Possible Worlds for Reasoning about Necessity - Stone (1997)(Correct)
this paper further the goal of building practical, efficient reasoning systems using
modal logics. The key problem in modal deduction is reasoning about the world in a
model (or scope in a proof) at w... / modal logic from planning to logic programming. Content area Reasoning br synthesis planning and logic programming can use modal logic as a
3367.1 Developing Correct and Efficient Logic Programs by Transformation - Pettorossi, Proietti (1996)(Correct)
this paper, from formal specifications one may obtain executable,
efficient programs by using techniques for transforming logic programs. This is, indeed, one of
the reasons that makes logic programmi... / one of the reasons that makes logic programming very attractive for program br for all notions concerning logic programming and logic program
3353.1 A Survey of Models of Parallel Computation - Campbell (1997)(Correct)
Serial computing's popularity can be attributed to the von Neumann model providing
a single, general model of serial computation. This has led to portability, predictability
and programmability in ser... / Unity functional programming logic programming constraint programming. br CSP CCS Unity functional programming logic programming constraint
3351.8 Higher-Order Logic Programming - Nadathur, Miller (1986)(Correct)
ly,
if a tactic R holds of G1 and G2, i.e., if (R G1 G2) is solvable from a presentation of primitive
tactics as a set of definite clauses, then satisfying the goal G2 in the object-language should su... / CS- - Higher-Order Logic Programming Gopalan Nadathur Dale br December Higher-Order Logic Programming y Gopalan Nadathur z
3347.4 Object-Level Substitution, Unification And Generalization In.. - Chuck C. Liang (1995)(Correct)
OBJECT-LEVEL SUBSTITUTION, UNIFICATION AND
GENERALIZATION IN META-LOGIC
CHUCK C. LIANG
Supervisor: DALE MILLER
Meta-programming in logic has had difficulty with a class of problems, which
includes po... / of this difficulty is that logic programming in particular higher-order br in particular higher-order logic programming is often too dependent on
3342.6 A Unified Approach to Theory Reasoning - Baumgartner, Furbach (1992)(Correct)
Theory reasoning is a kind of two-level reasoning in automated theorem
proving, where the knowledge of a given domain or theory is separated and treated by
special purpose inference rules. We define... / a textbook on constraints in logic programming we will concentrate on the br investigated in the context of logic programming and Prolog Van Hentenryck
3330.8 Specifying Logic Programs in Controlled Natural Language - Fuchs, Hofmann, Schwitter (1994)(Correct)
Writing specifications for computer programs is not easy since one has to take into account the disparate
conceptual worlds of the application domain and of software development. To bridge this concep... / . Graph Unification Logic Programming br with the language of logic programming and that statutes can
3303.1 Multiple Predicate Learning in Two Inductive Logic Programming.. - De Raedt, Lavrac (1996)(Correct)
Inductive logic programming (ILP) is a research area which has its roots in inductive machine learning
and computational logic. The paper gives an introduction to this area based on a distinction betw... / Learning In Two Inductive Logic Programming Settings Luc De Raedt br Abstract Inductive logic programming ILP is a research area
3295.3 Autoepistemic Logic as a Basis for Automating Nonmonotonic Reasoning - Niemelä (1995)(Correct)
Introduction
We study the problem of automating nonmonotonic reasoning, i.e., developing
an automated theorem prover for nonmonotonic reasoning. Several
forms of nonmonotonic reasoning have been prop... / as the basic system including logic programming default logic Reiter br current implementations of logic programming systems do not provide
3291.8 Program Derivation by Proof Transformation - Anderson (1993)(Correct)
In the proofs-as-programs methodology, verified programs are developed through theorem-proving in a constructive logic. Under this approach, the theorem-proving process can be regarded as a program de... / deduction metatheory logic programming Elf logical framework br is the use of a higher-order logic programming language as a logical
3271.4 Constraint Based Reasoning with Constraint Logic Programming and.. - Turner (1996)(Correct)
The paper describes how Constraint Based Reasoning (CBR) can be performed with
two different paradigms, Constraint Logic Programming (CLP) and Array Based
Logic (ABL). The author describes the operati... / Reasoning with Constraint Logic Programming and Array Based Logic br paradigms Constraint Logic Programming CLP and Array Based Logic
3264.1 Increasing Constraint Propagation by Redundant Modeling: an.. - Cheng, Choi, Lee, Wu (1999)(Correct)
This paper describes our experience with a simple modeling and programming
approach for increasing the amount of constraint propagation
in the constraint solving process. The idea, although similar to... / is realized in the constraint logic programming language CHIP and C br mechanisms of constraint logic programming CLP and concurrent
3257.6 Imagining CLP(^,= \alpha\beta ) - Ridoux (1995)(Correct)
We study under which conditions the domain of -terms ()
and the equality theory of the -calculus (j fffi ) form the basis of a usable
constraint logic programming language (CLP). The conditions are ... / basis of a usable constraint logic programming language CLP The br Prolog. Introduction Logic programming is a programming paradigm in
3253.8 Functional Database Query Languages as Typed Lambda Calculi of Fixed.. - Hillebrand, Kanellakis (1994)(Correct)
We present functional database query languages expressing the FO- and PTIME-queries. This
framework is a functional analogue of the logical languages of first-order and fixpoint formulas
over finite s... / facilitated the integration of logic programming techniques in databases. The br and Generalizations. J. Logic Programming pp. - .
3239.2 Finite Representation of Infinite Query Answers - Chomicki, Imielinski (1992)(Correct)
We define here a formal notion of finite representation of infinite query answers in
logic programs. We apply this notion to Datalog nS (Datalog with n successors): an extension of
Datalog capable ... / Keywords query processing logic programming Datalog decidability br and terminology used in logic programming and Datalog For further
3231.4 Semantics Of (disjunctive) Logic Programs Based On Partial Evaluation - Brass, Dix (1998)(Correct)
SEMANTICS AND TRANSFORMATIONS
In this paper, we consider allowed disjunctive DATALOG
:
programs over some
fixed function-free finite signature \Sigma. In fact, in the semantical part of this paper,... / J. Logic Programming - Semantics br understanding and computing logic programming semantics. We consider
3229.6 Mutable Object State for Object-Oriented Logic Programming: A Survey - Alexiev (1993)(Correct)
One of the most difficult problems on the way to an integration of Object-Oriented and Logic
Programming is the modeling of changeable object state (i.e. object dynamics) in a particular logic
in orde... / State for Object-Oriented Logic Programming A Survey Technical br of Object-Oriented and Logic Programming is the modeling of
3206.9 Viewing A Program Transformation System At Work - Paige (1994)(Correct)
How to decrease labor and improve reliability in the development of efficient implementations
of nonnumerical algorithms and labor intensive software is an increasingly important problem as
the demand... / This step is carried out in logic programming fashion by calculations br to the theory of lists. in Logic Programming and Calculi of Discrete
3171.8 What is Hybrid in Hybrid Representation and Reasoning Systems? - Nebel (1989)(Correct)
Hybrid knowledge representation and reasoning
systems have received a lot of interest
in recent years. In this paper, we
will give a brief survey of the principles and
ideas behind these systems and w... / and constraint logic programming Second we have a br framework and constraint logic programming. ffl A master slave
3162.4 Relational Learning Techniques for Natural Language Information.. - Califf (1998)(Correct)
The recent growth of online information available in the form of natural language documents creates a greater need for computing systems with the ability to process those documents to simplify access ... / from several Inductive Logic Programming ILP systems. These br In particular inductive logic programming ILP Lavrac Dzeroski
3162.3 On the Declarative and Procedural Semantics of Logic Programs - Przymusinski (1995)(Correct)
One of the most important and difficult problems in logic programming is
the problem of finding a suitable declarative or intended semantics for logic programs.
The importance of this problem stems fr... / and difficult problems in logic programming is the problem of finding a br the declarative character of logic programming whereas its difficulty can
3155.5 Updating Knowledge Bases while Maintaining their Consistency - Teniente, Olivé (1995)(Correct)
In general, several problems may arise when updating a knowledge base. One
of the most important ones is that of integrity constraints satisfaction. The classical
approach to deal with this problem ha... / the reader is familiar with logic programming Llo Basic br of Deductive Databases and Logic Programming J. Minker Ed.
3123.0 Intelligent Backtracking in the Echidna Constraint Logic Programming.. - Havens (1992)(Correct)
Abstract: A new type of reasoning engine for model-based expert system applications is described which
employs recent advances in constraint logic programming (CLP), intelligent backtracking (IB) and ... / in the Echidna Constraint Logic Programming System William S. Havens br recent advances in constraint logic programming CLP intelligent
3108.7 An Overview of Cooperative Answering - Gaasterland, al. (1992)(Correct)
Databases and information systems are often hard to use because they do not explicitly attempt to cooperate
with their users. Direct answers to database and knowledge base queries may not always be th... / query answering systems and logic programming and deductive databases. br . databases . logic programming and deductive databases In
3087.8 An Intuitionistic Interpretation of Finite and Infinite Failure - McCarty, van der Meyden (1993)(Correct)
In this paper, we propose an intuitionistic semantics for negation-as-failure
in logic programs. The basic idea is to work with the completion of the
program, not in classical logic, but in intuitioni... / to the problem of negation in logic programming the program completion br framework of intuitionistic logic programming
3080.7 Sequent Calculus and the Specification of Computation - Lecture Notes - Miller (1997)(Correct)
4
2 Overview and motivation 5
2.1 Roles for logic in the specific of computations . . . . . . . . . . . . . . . . . . 5
2.2 Desiderata for declarative programming . . . . . . . . . . . . . . . . . . ... / . Logic programming considered abstractly br . . The core of a logic programming language .
3074.7 Axiomatizing Reflective Logics and Languages - Clavel, Meseguer (1996)(Correct)
The very success and breadth of reflective techniques underscores the need for a
general theory of reflection. At present what we have is a wide-ranging variety of reflective
systems, each explained i... / Horn logic and rewriting logic programming languages and work on br in our sense for equational logic programming. A different approach is
3067.7 Is Intractability of Non-Monotonic Reasoning a Real Drawback? - Cadoli, Donini, Schaerf (1995)(Correct)
Several studies about computational complexity of non-monotonic
reasoning (NMR) showed that non-monotonic inference is significantly
harder than classical, monotonic inference. This contrasts with the... / a semantics for negation in logic programming known as well-founded br a further example from the logic programming field. Let P be a
3052.5 Programming Languages for Distributed Applications - Haridi, Van Roy, Brand, Schulte (1998)(Correct)
Much progress has been made in distributed computing in the areas of distribution structure,
open computing, fault tolerance, and security. Yet, writing distributed applications remains difficult
beca... / an evolution of concurrent logic programming has both the br Oz has deep roots in the logic programming and concurrent logic
3051.6 Complexity, Decidability and Undecidability Results for.. - Erol, Nau, Subrahmanian (1991)(Correct)
In this paper, we examine how the complexity of domain-independent planning with
STRIPS-style operators depends on the nature of the planning operators.
We show conditions under which planning is deci... / . Equivalence between Logic Programming and Planning br A. Equivalence between Logic Programming and Planning
3036.2 Towards Effective Evaluation of General Logic Programs - Weidong Chen (1993)(Correct)
SLD resolution with negation as finite failure (or SLDNF) reflects the procedural interpretation
of Horn-clause predicate logic as a programming language and forms the computational
basis for Prolog s... / for the next generation of logic programming systems. Contents br an efficient engine for logic programming is more difficult. The goal
3027.8 Reflection in logic, functional and object-oriented programming: a.. - Demers, Malenfant(Correct)
Reflection is a wide-ranging concept that has been studied
independently in many different areas of science in general,
and computer science in particular. Even in the sub-area
of programming language... / Quite independently the logic programming community become interested br and Black AMY . Logic programming All the different issues
3023.2 The Compilation of Prolog and its Execution with MALI - Brisset, Ridoux (1993)(Correct)
We present a compiled implementation of Prolog that uses the abstract memory
MALI for representing the execution state.
Prolog is a logic programming language allowing a more general clause form than... / state. Prolog is a logic programming language allowing a more br as lecture notes for the Logic Programming Winter School and Seminar
3013.5 A Methodological View of Constraint Solving - Comon, al. (1997)(Correct)
Constraints are an effective tool to define sets of data by means of logical formulae.
Our goal here is to survey the notion of constraint system and to give examples of constraint systems
operating... / For example combining logic programming and constraints is achieved br unification component of a logic programming language by constraint
3000.8 Oracle Semantics for Prolog - Barbuti, Codish (1992)(Correct)
This paper proposes to specify semantic definitions for logic programming languages such
as Prolog in terms of an oracle which specifies the control strategy and identifies which
clauses are to be app... / semantic definitions for logic programming languages such as Prolog in br semantics as well as other logic programming languages. Previous
2991.2 A Framework for Integrating Artificial Neural Networks and Logic.. - Lee, Tam (1995)(Correct)
Many real-life problems belong to the class of constraint satisfaction problems (CSP's), which
are NP-complete, and some NP-hard, in general. When the problem size grows, it becomes
difficult to progr... / Neural Networks and Logic Programming J.H.M. Lee Department of br artificial neural networks and logic programming so as to provide an
2981.3 Interleaving Natural Language Parsing and Generation Through Uniform.. - Neumann (1998)(Correct)
We present a new model of natural language processing in which natural language
parsing and generation are strongly interleaved tasks. Interleaving of parsing
and generation is important if we assume ... / and introduce constraint logic programming CLP as an appropriate br are used. . Constraint-logic programming Since the last decade a
2980.1 On The Acceptability Of Arguments And Its Fundamental Role In.. - Dung (1995)(Correct)
The purpose of this paper is to study the fundamental mechanism, humans use in argumentation, and to explore ways to implement this mechanism on computers. We do so by first developing a theory for ar... / In Nonmonotonic Reasoning Logic Programming And N-Persons Games Phan br reasoning in AI and logic programming are special forms of our
2979.5 The F-Logic Approach for Description Languages - Balaban (1993)(Correct)
The Frame-logic (F-logic) approach of [20] is suggested as an underlying framework for description languages.
F-logic is shown to provide a full account for description languages, without losing the d... / coherently integrates with logic programming and deductive br ffl Integration with logic programming object-oriented systems
2958.0 A Recursion Parallel Prolog Engine - Bevemyr (1993)(Correct)
We present the design and implementation of a recursion parallel Prolog engine
based on the Reform execution model. This is a data-parallel approach to parallelizing
Prolog on MIMD machines. The imple... / from Tick's book on parallel logic programming page The book br written for different parallel logic programming systems. The quote is from
2944.2 Efficient Implementation of the Stable Model Semantics for Normal.. - Simons (1995)(Correct)
The aim of this work is to develop an efficient implementation method of
the stable model semantics of logic programs with negation using as a basis a lately
proposed decision procedure for Reiter's... / well-founded semantics logic programming nonmonotonic reasoning br of Deductive Databases and Logic Programming pages - . Morgan
2926.4 Managing Complex Objects in Peirce - Ellis, Levinson, Robinson (1994)(Correct)
The Peirce project (named after Charles Sanders Peirce) is an international collaborative
project aiming to construct a freely available conceptual graphs workbench to support
research in the conceptu... / of an object-oriented graphic logic programming language is under way and a br of our research in a visual logic programming language based on conceptual
2916.1 Specifying Real-Time Finite-State Systems in Linear Logic - Kanovich, Okada, Scedrov (1998)(Correct)
Real-time finite-state systems may be specified in linear logic by means of linear implications
between conjunctions of fixed finite length. In this setting, where time is treated as a
dense linear or... / proof search in concurrent logic programming environments based on br in the available concurrent logic programming environments based on
2904.6 Deterministic and Non-Deterministic Stable Models - Sacca, Zaniolo (1997)(Correct)
Stable models have been first introduced in the domain of total interpretations (T-
stable models), where the existence of multiple T-stable models for the same program
provides a powerful mechanism ... / programs. Keywords logic programming stable models br issue in areas such as logic programming non-monotonic reasoning
2897.1 Bayesian Inductive Logic Programming - Muggleton (1994)(Correct)
Inductive Logic Programming (ILP) involves the
construction of first-order definite clause theories
from examples and background knowledge. Unlike
both traditional Machine Learning and Computational
L... / Bayesian Inductive Logic Programming Stephen Muggleton br QD. Abstract Inductive Logic Programming ILP involves the
2893.0 Set-based Analysis of Reactive Infinite-state Systems - Podelski, Charatonik, Müller (1997)(Correct)
We consider reactive infinite-state systems specified
by logic programs. Using set-based program analysis,
we infer conservative approximations of temporal logic
(CTL) properties of the systems. Our a... / analysis set constraints logic programming reactive systems br the terminology of constraint logic programming a state consists of
2888.2 The ECCE Partial Deduction System - Leuschel(Correct)
Interpretation
". Most parts of the ecce system grew out of joint work with D. De Schreye, R. Gluck,
J. Jørgensen, B. Martens, M.H. Sørensen and A. de Waal. I am also grateful to Wim Vanhoof, the
most... / advantages in the context of logic programming. This paper is structured br considerable attention in logic programming and functional
2884.5 Bottom-up Evaluation and Query Optimization of Well-Founded Models - Kemp, Srivastava, Stuckey (1995)(Correct)
We present a bottom-up operational procedure for computing well-founded models of allowed
programs with negation. This procedure provides a practical method of handling programs that
involve unstratif... / general-purpose imperative logic programming language such as Prolog br We assume familiarity with logic programming terminology see The
2876.0 A New Procedural Interpretation of Horn Clauses with Equality - Degtyarev, Voronkov (1994)(Correct)
We introduce the equality elimination method which is a new procedure for
dealing with Horn clause logic programs with equality. The method combines
SLD-resolution with a bottom-up equation solving. B... / deals with a new approach to logic programming with equality. By a logic br in the theorem proving and logic programming communities. Most existing
2858.6 Abduction and Learning - Dimopoulos, Kakas (1996)(Correct)
In this paper we study the problem of of integrating abduction and learning as they appear in Artificial Intelligence. A general comparison of abduction and induction as separate inferences and fiel... / within its subarea of Logic Programming. As such it is an attempt br the two fields of Abductive Logic Programming and Inductive Logic
2825.6 Transforming Prioritized Defaults and Specificity into Parallel.. - Grosof (1995)(Correct)
and Summary
We show how to transformany set of prioritized propositional
defaults into an equivalent set of parallel (i.e., unprioritized)
defaults, in circumscription. We give an algorithm to implem... / Shoham including for logic programming with negation-as-failure br use of negation-as-failure in logic programming e.g.inProlog. Both
2825.1 Clausal Discovery - De Raedt, Dehaspe (1996)(Correct)
The clausal discovery engine Claudien is presented. Claudien is an inductive
logic programming engine that fits in the knowledge discovery in databases
and data mining paradigm as it discovers regular... / Claudien is an inductive logic programming engine that fits in the br Keywords Inductive Logic Programming Knowledge Discovery in
2813.0 Learning an Optimally Accurate Representation System - Greiner, Schuurmans (1994)(Correct)
A default theory can sanction different, mutually incompatible,
answers to certain queries. We can identify each such theory with
a set of related credulous theories, each of which produces but a si... / the body of work on inductive logic programming MB While much of that br Technical Report CS- - Logic Programming and Artificial Intelligence
2806.0 Inductive Synthesis of Recursive Logic Programs: Achievements and.. - Flener, Yilmaz(Correct)
The synthesis of recursive logic programs from incomplete information, such as input/output examples, is a
challenging subfield both of ILP (Inductive Logic Programming) and of the synthesis (in gener... / both of ILP Inductive Logic Programming and of the synthesis in br form the task of Inductive Logic Programming ILP is to infer a
2801.4 The Architecture of an Implementation of LambdaProlog: Prolog/Mali - Brisset, Ridoux (1995)(Correct)
Prolog is a logic programming language accepting a more general clause form than standard
Prolog (hereditary Harrop formulas instead of Horn formulas) and using simply typed
-terms as a term domain i... / Abstract Prolog is a logic programming language accepting a more br Introduction The logic programming language Prolog
2799.8 Parallelism and the Bird-Meertens Formalism - Skillicorn (1992)(Correct)
One of the major reasons for the lack of practical use of parallel computers
has been the absence of a suitable model of parallel computation. A useful
general model must be architecture independent, ... / Eqlog adding a form of logic programming and FOOPlog which adds
2780.3 An Overview of the CAPITL Software Development Environment - Adams, Solomon (1995)(Correct)
The CAPITL programming environment is comprised of a
shared, object-oriented, versioned database, an embedded logic-based
data-manipulation language, and a graphical user interface. With each
softwa... / extension by inheritance logic programming languages allow programmers br Congress may be described as a logic programming language a deductive
2768.9 Regular Search Spaces and Constructive Negation - Alberto Momigliano (1997)(Correct)
The aim of this paper is to show the fruitfulness and fecundity of the proof-theoretic
analysis of logic programming initiated in [33] (both for definite and normal programs).
It is based on a simple ... / proof-theoretic analysis of logic programming initiated in both for br problem that has plagued logic programming from its very beginning.
2740.4 Approaches to Deductive Object-Oriented Databases - Fernandes, Paton, Williams, Bowles (1992)(Correct)
This paper is concerned with the problem of combining deductive and object-oriented features to produce a deductive
object-oriented database system which is comparable to those currently available und... / goal of integrating ideas from logic programming and the object-oriented br in the database using the logic-programming paradigm of computation.
2737.4 The Logic of Bunched Implications - O'Hearn, Pym (1999)(Correct)
We introduce a logic BI in which a multiplicative (or linear) and an additive (or intuitionistic) implication
live side-by-side. The propositional version of BI arises from an analysis of the proof-th... / of the computer's store and logic programming where the resource br section under the heading of logic programming. The Sharing
2730.5 First-order Lax Logic as a Framework for Constraint Logic Programming - Fairtlough Mendler (1997)(Correct)
In this report we introduce a new proof-theoretic approach to the semantics of Constraint
Logic Programming, based on an intuitionistic first-order modal logic, called QLL. The distinguishing
feature ... / as a Framework for Constraint Logic Programming M. Fairtlough M. Mendler br as a framework for Constraint Logic Programming Matt Fairtlough
2726.1 "Classical" Negation in Non-Monotonic Reasoning and Logic Programming - Alferes, Pereira, al. (1998)(Correct)
this paper appeared in the Proceedings of the European Workshop on Logic in
Artificial Intelligence (JELIA'96), Lecture Notes on Artificial Intelligence, Springer Verlag, 1996, vol. 1126,
pp. 143-163. / Non-Monotonic Reasoning and Logic Programming Jos'e Alferes y br the somewhat vague spirit of logic programming and deductive databases
2718.7 Higher-order, linear, concurrent constraint programming - Saraswat, Lincoln (1992)(Correct)
We present a very simple and powerful framework for indeterminate, asynchronous,
higher-order computation based on the formula-as-agent and proof-ascomputation
interpretation of (higher-order) linear... / of the areas of concurrent logic programming and constraint logic br programming and constraint logic programming. But where are the logical
2717.7 Expanding Queries to Incomplete Databases By Interpolating General.. - Baral, Gelfond, Kosheleva (1998)(Correct)
In databases, queries are usually defined on complete databases. In this paper we introduce and
motivate the notion of extended queries that are defined on incomplete databases. We argue that
the lang... / abductions in extensions of logic programming For a survey on this see br there has not been any logic programming representation of this
2710.5 A Learnability Model for Universal Representations - Muggleton, Page, Jr. (1997)(Correct)
This paper defines a new computational model of inductive learning, called U-learnability
(Universal Learnability), that is well-suited for rich representation languages, most notably for
universal (... / as it has in Inductive Logic Programming The Occam assumption br setting used in Inductive Logic Programming and its roots go back at
2699.3 The Complexity of Revising Logic Programs - Greiner (1996)(Correct)
A rule-based program will return a set of answers to each query. An impure program,
which includes the Prolog cut "!" and "not(\Delta)" operators, can return different
answers if its rules are re-orde... / Theory Revision Inductive Logic Programming Computational Complexity br correct. A typical Inductive Logic Programming ILP system would use
2693.3 Reasoning about actual and hypothetical occurances of concurrent and.. - Baral, Gelfond, Watson (1995)(Correct)
We propose extension L 2 of the action description language L 1 that can express
both actual and hypothetical situations, concurrent execution of actions, observations
of the truth values of fluents i... / theory and implementation of logic programming languages AB Tur br the theory of declarative logic programming. In addition to negation as
2683.1 Efficient Implementation of Unification-Based Grammars - Wintner, Francez (1999)(Correct)
Contemporary linguistic formalisms such as LFG or HPSG have become so rigorous that it is now
possible to view them as very high level declarative programming languages. Consequently, grammars
for na... / technique that is common for logic programming languages namely the use of br technique that is common for logic programming languages namely the use
2667.6 Discovering Robust Knowledge from Databases that Change - Hsu, Knoblock(Correct)
Many applications of knowledge discovery and data mining such as rule discovery
for semantic query optimization, database integration and decision support, require
the knowledge to be consistent with ... / can be applied in inductive logic programming ILP an important data br Saso Dzeroski. Inductive logic programming and knowledge discovery in
2658.4 Fundamentals Of Deductive Program Synthesis - Manna, Waldinger (1992)(Correct)
An informal tutorial is presented for program synthesis, with an emphasis on deductive methods. According to this approach, to construct a program meeting a given specification, we prove the existence... / and Horning GH ffl Logic Programming. Executing a program br Provers in a Higher-Order Logic Programming Language Ninth
2649.8 Three-Valued Non-Monotonic Formalisms And Semantics of Logic Programs - Przymusinski(Correct)
We introduce 3-valued extensions of major non-monotonic formalisms and we prove that the recently proposed well-founded semantics of logic programs is equivalent, for arbitrary logic programs, to 3-va... / methods developed for logic programming as inference mechanisms br grant -MA-SAH. logic programming and deductive databases. It
2648.8 Computing argumentation in logic programming - Kakas, Toni (1999)(Correct)
In recent years, argumentation has been shown to be an appropriate framework in which
logic programming with negation as failure as well as other logics for non-monotonic reasoning
can be encompassed.... / Computing argumentation in logic programming Antonios C. Kakas br framework in which logic programming with negation as failure as
2618.1 A First-Order Theory of Types and Polymorphism in Logic Programming - Kifer, Wu (1990)(Correct)
We describe a new logic called typed predicate calculus (T PC) that gives declarative meaning
to logic programs with type declarations and type inference. T PC supports all popular types of
polymorphi... / of Types and Polymorphism in Logic Programming Michael Kifer br Introduction Classical logic programming lacks the notion of typing
2615.2 Uniform Closures: Order-Theoretically Reconstructing Logic Program.. - Giacobazzi, al.(Correct)
Domain Refinements
Roberto Giacobazzi
Dipartimento di Informatica
Universit`a di Pisa
Corso Italia 40, 56125 Pisa, Italy
giaco@di.unipi.it
Francesco Ranzato
Dipartimento di Matematica Pura ed Appl... / domain refinements. In logic programming uniform closures permit to br reconstruct the ssemantics of logic programming we yield a precise
2611.6 Conservative Extension in Positive/Negative Conditional Term.. - Fokkink, Verhoef (1998)(Correct)
We transpose a conservative extension theorem from structural
operational semantics to conditional term rewriting. The result is
useful for the development of software renovation factories, and for ... / stable models from logic programming. Van de Pol used br well-established notions from logic programming See for a
2610.8 Demand Interprocedural Program Analysis Using Logic Databases - Reps (1994)(Correct)
This paper describes how algorithms for demand versions of inerprocedural programanalysis
problems can be obtained from their exhaustive counterparts essentially for
free, by applying the so-called ma... / that was developed in the logic-programming and deductive-database br that was developed in the logic-programming and deductivedatabase
2604.4 Automatic Parallelization of Irregular and Pointer-Based.. - Manuel Hermenegildo (1997)(Correct)
Irregular computations pose some of the most interesting and
challenging problems in automatic parallelization. Irregularity appears in
certain kinds of numerical problems and is pervasive in symbol... / of parallelizing compilers for logic programming and more recently br for details. Constraint logic programming also provides a method for
2598.0 Automated Refinement of First-Order Horn-Clause Domain Theories - Richards, Mooney (1995)(Correct)
Knowledge acquisition is a difficult, error-prone, and time-consuming
task. The task of automatically improving an existing knowledge base using
learning methods is addressed by the class of systems p... / in several domains including logic programming and qualitative modelling. br body of work in inductive logic programming ILP Muggleton