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.
755.6 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
565.9 GOLOG: A Logic Programming Language for Dynamic Domains - Levesque, Reiter, Lespérance, .. (1997)(Correct)
This paper proposes a new logic programming language called GOLOG whose interpreter automatically maintains an explicit representation of the dynamic world being modeled, on the basis of user supplied... / GOLOG A Logic Programming Language for Dynamic br This paper proposes a new logic programming language called GOLOG whose
530.4 The Oz Programming Model - Smolka (1995)(Correct)
The Oz Programming Model (OPM) is a concurrent programming model subsuming higher- order functional and object-oriented programming as facets of a general model. This is particularly interesting for c... / capabilities of constraint logic programming. OPM has been developed br functional and logic programming two declarative
441.9 Logic Programming in a Fragment of Intuitionistic Linear Logic - Hodas, Miller (1994)(Correct)
When logic programming is based on the proof theory of intuitionistic logic, it is natural
to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of
the form D oe G fr... / Logic Programming in a Fragment of br Abstract When logic programming is based on the proof theory
413.7 Constraint Query Languages - Kanellakis, Kuper, Revesz (1992)(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
391.7 Representing Action and Change by Logic Programs - Gelfond, Lifschitz (1993)(Correct)
We represent properties of actions in a logic programming language
that uses both classical negation and negation as failure. The
method is applicable to temporal projection problems with incomplete
i... / properties of actions in a logic programming language that uses both br properties of actions in logic programming languages with negation as
391.3 Partial Constraint Satisfaction - Freuder, Wallace (1992)(Correct)
A constraint satisfaction problem involves finding values for variables subject to constraints on which combinations of values are allowed. In some cases it may be impossible or impractical to solve... / been imbedded in a constraint logic programming language Hower used br Constraint hierarchies and logic programming. In Proceedings Sixth
344.8 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
288.2 Classical Negation in Logic Programs and Disjunctive Databases - Gelfond, Lifschitz (1991)(Correct)
An important limitation of traditional logic programming as a knowledge representation tool, in
comparison with classical logic, is that logic programming does not allow us to deal directly with
incom... / limitation of traditional logic programming as a knowledge br with classical logic is that logic programming does not allow us to deal
286.9 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
275.4 Efficient Induction Of Logic Programs - Muggleton, Feng (1990)(Correct)
Recently there has been increasing interest in systems which induce first order logic programs from examples. However, many difficulties need to be overcome. Well-known algorithms fail to discover cor... / and other concepts used in logic programming see br 'predicates by logic programmers they both conform to the
263.2 A Logic Programming Language with Lambda-Abstraction, Function.. - Miller (1991)(Correct)
ion, Function Variables, and Simple Unification Dale Miller Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104--6389 USA Abstract: It has been argued else... / A Logic Programming Language with br been argued elsewhere that a logic programming language with function
260.8 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
259.0 The Object-Oriented Database System Manifesto - Atkinson, Bancilhon, DeWitt.. (1989)(Correct)
This paper attempts to define an object-oriented database system. It describes the main features and characteristics that a system must have to qualify as an objectoriented database system. We have se... / object-oriented programming to logic programming there is no equivalent of br more than another the logic programming style Bancilhon
222.2 Actions with Indirect Effects - Kartha, Lifschitz (1994)(Correct)
We define and study a high-level language for
describing actions that extends the language
A introduced by Gelfond and Lifschitz. The
new language, AR 0 , allows us to describe actions
with indirect ... / its nonmonotonic extensions logic programming and by other details of br for representing actions in logic programming is specified as a
204.4 Semantic foundations of concurrent constraint programming - Saraswat, Rinard, Panangaden (1991)(Correct)
Concurrent constraint programming [Sar89,SR90] is a simple and powerful model of concurrent computation based on the notions of store-as constraint and process as information transducer. The store-as-... / the concurrent constraint logic programming languages. This paper br of renaming that plague logic programming semantics and show that
185.5 Reasoning about Termination of Pure Prolog Programs - Apt, al. (1993)(Correct)
We provide a theoretical basis for studying termination of (general) logic programs with
the Prolog selection rule. To this end we study the class of left terminating programs. These
are logic program... / programming language based on logic programming. However the use of a fixed br search trees makes Prolog and logic programming different. As a consequence
185.5 The NRL Protocol Analyzer: An Overview - Meadows (1996)(Correct)
this paper we give an overview of how the
Analyzer works and describe its achievements so far. We also show how our
use of the Prolog language benefited us in the design and implementation
of the Anal... / J. Logic Programming - The br Dc The Journal Of Logic Programming C Fl Elsevier Science
182.9 Relational Learning of Pattern-Match Rules for Information Extraction - Califf, Mooney (1997)(Correct)
Information extraction systems process
natural language documents and locate
a specific set of relevant items. Given
the recent success of empirical or corpusbased
approaches in other areas of natura... / from several inductive logic programming systems and learns br inspired by several Inductive Logic Programming ILP systems and primarily
179.7 Learning Trees and Rules with Set-valued Features - Cohen (1996)(Correct)
In most learning systems examples are represented as fixed-length "feature vectors", the components of which are either real numbers or nominal values. We propose an extension of the featurevector rep... / For instance many inductive logic programming systems Quinlan b br someone with no background in logic programming or knowledge
173.5 Standard ML of New Jersey - Appel, MacQueen (1991)(Correct)
The Standard ML of New Jersey compiler has been under development for five years now. We have developed a robust and complete environment for Standard ML that supports the implementation of large soft... / Prog. Lang. Implementation and Logic Programming Springer-Verlag LNCS
172.7 Learning Probabilistic Relational Models - Friedman, Getoor, Koller, Pfeffer (1999)(Correct)
A large portion of real-world data is stored in commercial
relational database systems. In contrast,
most statistical learning methods work only with
"flat" data representations. Thus, to apply these
... / Until now inductive logic programming ILP Lavra c and br and S. Dzeroski. Inductive Logic Programming Techniques and
158.8 Logic Programming in the LF Logical Framework - Pfenning (1991)(Correct)
this paper we describe Elf, a meta-language intended for environments dealing
with deductive systems represented in LF.
While this paper is intended to include a full description of the Elf core langu... / Logic Programming in the LF Logical Framework br and Future Work Logic Programming in the LF Logical Framework
154.5 Programming in an Integrated Functional and Logic Language - Lloyd (1999)(Correct)
Escher is a general-purpose, declarative programming language that integrates the best features of both functional and logic programming languages. It has types and modules, higher-order and meta-prog... / The Journal of Functional and Logic Programming The MIT Press Volume br The Journal of Functional and Logic Programming is a peer-reviewed and
154.2 Pitfalls of Agent-Oriented Development - Wooldridge, Jennings (1998)(Correct)
While the theoretical and experimental foundations of agent-based
systems are becoming increasingly well understood, comparatively
little effort has been devoted to understanding the pragmatics of
(mu... / against expert systems logic programming and all the other good
150.7 Principles of Maude - Clavel, Eker, Lincoln, Meseguer (1996)(Correct)
This paper introduces the basic concepts of the rewriting logic language Maude and
discusses its implementation. Maude is a wide-spectrum language supporting formal
specification, rapid prototyping, a... / a conservative way Horn logic programming can also be supported and br Vittek. Designing constraint logic programming languages using
148.9 Semistructured and Structured Data in the Web: Going Back and Forth - Paolo Atzeni (1997)(Correct)
this paper, we present the approach to the management of Web data as attacked in the Araneus unknown Semistructured and Structured Data in the Web:
Going Back and Forth
Paolo Atzeni,
Giansalvatore M... / refer to the Database and Logic Programming Bibliography server at Trier br M. Ley. Database systems and logic programming bibliography server.
148.5 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
146.3 Indexing for Data Models with Constraints and Classes - Kanellakis, Ramaswamy, Vengroff.. (1993)(Correct)
We examine I/O-efficient data structures that provide indexing support for new data models. The database languages of these models include concepts from constraint programming (e.g., relational tuples... / adapts ideas of Constraint Logic Programming e.g.from to br and J. L. Lassez Constraint Logic Programming Proc. th ACM
145.4 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
145.4 Complexity and expressive power of logic programming - Dantsin, Eiter, Gottlob, Voronkov (1999)(Correct)
This paper surveys various complexity and expressiveness results on different forms of
logic programming. The main focus is on decidable forms of logic programming, in particular,
propositional logi... / Expressive Power Of Logic Programming Evgeny Dantsin Georg br Expressive Power Of Logic Programming Evgeny Dantsin
144.9 Efficient Implementation of the Well-founded and Stable Model.. - Niemelä, Simons (1996)(Correct)
An implementation of the well-founded and stable model semantics for rangerestricted
function-free normal programs is presented. It includes two modules:
an algorithm for implementing the two semantic... / C. Baral and M. Gelfond. Logic programming and knowledge br representation. Journal of Logic Programming - .
144.6 Hybrid Probabilistic Programs - Dekhtyar, V.S.Subrahmanian (1997)(Correct)
The precise probability of a compound event (e.g. e1 e2 ; e1 e2) depends upon the known
relationships (e.g. independence, mutual exclusion, ignorance of any relationship, etc.) between
the primitive... / research on probabilistic logic programming has br a hybrid probabilistic logic programming language in which the user
143.2 XSB as an Efficient Deductive Database Engine - Sagonas (1994)(Correct)
In this paper we describe the XSB system, an in-memory deductive database engine. XSB began from a Prolog foundation, and traditional Prolog systems are known to have a number of serious deficiencies ... / forms the basic language of logic programming is an elegant language for br deductive databases. Logic programming has an efficient
142.0 Relational Instance-Based Learning - Emde, Wettschereck (1996)(Correct)
A relational instance-based learning algorithm, called Ribl, is motivated and developed in this paper. We argue that instancebased methods offer solutions to the often unsatisfactory behavior of curre... / behavior of current inductive logic programming ILP approaches in domains br The field of Inductive Logic Programming ILP has matured enough in
139.1 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
138.2 Records for Logic Programming - Smolka, Treinen (1994)(Correct)
CFT is a new constraint system providing records as logical data
structure for constraint (logic) programming. It can be seen as a generalization
of the rational tree system employed in Prolog II, whe... / Records for Logic Programming Gert Smolka and Ralf br structure for constraint logic programming. It can be seen as a
137.7 Deriving Production Rules for Constraint Maintenance - Ceri (1990)(Correct)
Traditionally, integrity constraints in database
systems are maintained either by rolling back any transaction
that produces an inconsistent state or by disallowing
or modifying operations that may ... / and enforcement. In CG logic programming is used to express and br integrity constraints through logic programming. Technical Report -
137.1 Logic Programs with Stable Model Semantics as a Constraint.. - Niemelä (1998)(Correct)
Logic programming with the stable model semantics is put forward as an interesting constraint programming paradigm. It is shown that the paradigm embeds classical logical satisfiability but seems to p... / ini Abstract Logic programming with the stable model br is to bring advantages of logic programming based knowledge
136.3 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
136.2 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
133.3 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
131.9 Representing Action: Indeterminacy and Ramifications - Giunchiglia (1997)(Correct)
We define and study a high-level language for describing actions, more
expressive than the action language A introduced by Gelfond and Lifschitz.
The new language, AR, allows us to describe actions wi... / its nonmonotonic extensions logic programming and by other details of br actions in extended logic programming. In Proc. of IJCAI-
128.3 A Multiple-Conclusion Meta-Logic - Miller (1994)(Correct)
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic refinement, Lolli [12... / the design of a number of logic programming languages. Two such br for concurrency. The logic programming language LO Linear
127.2 Developing a Declarative Rule Language for Applications in Product.. - Soininen, Niemelä (1999)(Correct)
A rule-based language is proposed for product con guration
applications. It is equipped with a declarative semantics providing formal
de nitions for main concepts in product con guration, including ... / on developing a logic programming like rule language for br chosen. Relationship to Logic Programming Semantics The con
126.4 A Scheme for Integrating Concrete Domains into Concept Languages - Baader, Hanschke (1991)(Correct)
A drawback which concept languages based on kl-one have is that all the terminological
knowledge has to be defined on an abstract logical level. In many applications,
one would like to be able to refe... / For similar reasons Logic Programming has been extended to br been extended to Constraint Logic Programming CLP see e.g.Jaffar
126.4 Stable Semantics for Disjunctive Programs - Przymusinski (1991)(Correct)
We introduce the stable model semantics for disjunctive logic programs and deductive databases, which generalizes the stable model semantics, defined earlier for normal (i.e., non-disjunctive) program... / pointed out GL that in logic programming it is often useful to use br GL pointed out that in logic programming it is often useful to use
125.9 April - Agent PRocess Interaction Language - McCabe, Clark (1994)(Correct)
In this paper we introduce key features of a programming language for building DAI and other
types of distributed applications requiring the transmission and manipulation of complex symbolic
data. The... / prototyped using a distributed logic programming system IC-Prolog II
123.7 Constraint Arithmetic on Real Intervals - Older (1993)(Correct)
Constraint interval arithmetic is a sublanguage of BNR Prolog which offers
a new approach to the old problem of deriving numerical consequences from
algebraic models. Since it is simultaneously a nume... / arithmetic in constraint logic programming languages typically applies br backtracking and the logic programming paradigm radically changes
123.5 Programming Paradigms of the Andorra Kernel Language - Janson (1991)(Correct)
The Andorra Kernel Language (AKL) is introduced. It is shown how AKL provides the programming paradigms of both Prolog and GHC. This is the original goal of the design. However, it has also been possi... / AKL is a general concurrent logic programming language that is based on br languages and constraint logic programming in a single unified
123.4 Improved CLP Scheduling with Task Intervals - Caseau, Laburthe (1994)(Correct)
In this paper we present a new technique that can be used to improve performance of job
scheduling with a constraint programming language. We show how, by focusing on some
special sets of tasks, one c... / with an extensible constraint logic programming language. In both cases we br the flexibility of constraint logic programming CLP However the nature
119.1 Encoding Planning Problems in Nonmonotonic Logic Programs - Dimopoulos, Nebel, Koehler (1997)(Correct)
We present a framework for encoding planning problems
in logic programs with negation as failure, having computational efficiency
as our major consideration. In order to accomplish our goal, we
brin... / we bring together ideas from logic programming and the planning systems br becomes available. Logic programming systems accommodate
119.1 Part-of-Speech Tagging Using Progol - Cussens (1997)(Correct)
A system for `tagging' words with their part-of-speech (POS)
tags is constructed. The system has two components: a lexicon containing
the set of possible POS tags for a given word, and rules which u... / for a word. The Inductive Logic Programming ILP system Progol is used br application of the Inductive Logic Programming ILP system Progol to
119.1 Knowledge Compilation Using Horn Approximations - Selman, Kautz (1991)(Correct)
We present a new approach to developing fast and efficient knowledge representation
systems. Previous approaches to the problem of tractable inference
have used restricted languages or incomplete infe... / Moreover the experience with logic programming and databases suggests that br horn formula. Journal of Logic Programming - .
118.8 Using meta-logic to reconcile reactive with rational agents - Kowalski (1995)(Correct)
In this paper I outline an attempt to reconcile the traditional Artificial
Intelligence notion of a logic-based rational agent with the contrary notion of
a reactive agent that acts "instinctively" ... / I will use the tools of meta-logic programming to define the br using the tools of meta-logic programming to combine assimilation of
118.1 Active Learning for Natural Language Parsing and Information.. - Thompson, Califf, Mooney (1999)(Correct)
In natural language acquisition, it is difficult to gather the annotated data needed for supervised learning; however, unannotated data is fairly plentiful. Active learning methods attempt to select f... / It uses inductive logic programming ILP methods Muggleton br S. Inductive Logic Programming Techniques and
117.2 Theory of Generalized Annotated Logic Programming and its Applications - Kifer, Subrahmanian (1992)(Correct)
Annotated logics were introduced in [43] and later studied in [5, 7, 31, 32]. In [31],
annotations were extended to allow variables and functions, and it was argued that such logics
can be used to pro... / of Generalized Annotated Logic Programming and its Applications br proposals for multivalued logic programming as
115.9 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
111.3 Representing Incomplete Knowledge in Abductive Logic Programming - Denecker (1993)(Correct)
Recently, Gelfond and Lifschitz presented a formal language for representing incomplete
knowledge on actions and states, and a sound translation from this language to
extended logic programming. We pr... / Knowledge in Abductive Logic Programming Marc Denecker y br this language to extended logic programming. We present an alternative
111.3 A Demand Driven Computation Strategy for Lazy Narrowing - Loogen, Fraguas, Artalejo (1993)(Correct)
Many recent proposals for the integration of functional and
logic programming use conditional term rewriting systems (CTRS) as
programs and narrowing as goal solving mechanism. This paper specifies
... / integration of functional and logic programming use conditional term br integration of functional and logic programming take conditional term
111.1 Splitting a Logic Program - Lifschitz, Turner (1994)(Correct)
In many cases, a logic program can be divided into two parts, so that one
of them, the "bottom" part, does not refer to the predicates defined in the
"top" part. The "bottom" rules can be used then fo... / of Deductive Databases and Logic Programming pages - . Morgan br Int'l Conf. and Symp. on Logic Programming pages - .
110.1 Applications of Machine Learning and Rule Induction - Langley, Simon (1995)(Correct)
An important area of application for machine learning is in automating the acquisition of knowledge
bases required for expert systems. In this paper, we review the major paradigms for machine
learning... / Learning inductive logic programming reviewed by Bratko and br this problem using inductive logic programming which they felt was
105.1 Tabulated Resolution for Well Founded Semantics - Bol, Degerstedt (1993)(Correct)
Based on the search forest for positive programs as defined by Bol and
Degerstedt, we define a tabulated version of SLS-resolution that is sound
and complete w.r.t. well founded semantics. In contrast... / forest is finite. Keywords logic programming deductive databases well br We use the standard logic programming terminology and definitions
102.8 What can Knowledge Representation do for Semi-Structured Data? - Calvanese, De Giacomo, Lenzerini (1998)(Correct)
The problem of modeling semi-structured data is important in
many application areas such as multimedia data management,
biological databases, digital libraries, and data integration.
Graph schemas (Bu... / First Order Logic nor Logic Programming nor Frame-based languages br First Order Logic nor Logic Programming nor Frame-based languages
102.1 Update By Means Of Inference Rules - Przymusinski, Turner (1997)(Correct)
Katsuno and Mendelzon have distinguished two abstract frameworks for reasoning about change: theory revision and theory update. Theory revision involves a change in knowledge or belief with respect to... / in a language similar to logic programming. While revision programs br The Journal Of Logic Programming C Fl Elsevier Science
101.4 Minimal Model Generation with Positive Unit Hyper-Resolution Tableaux - Bry, Yahya (1996)(Correct)
Herbrand models for clausal theories are useful in several areas of computer science. In most cases, however, the conventional model generation algorithms are inappropriate because they generate non... / Model generation is useful in logic programming and deductive databases for br th Int. Conf. on Logic Programming - . MIT Press .
99.9 Strategic Pattern Matching - Visser (1999)(Correct)
Stratego is a language for the speci cation of transformation
rules and strategies for applying them. The basic actions of transformations
are matching and building instantiations of rst-order term... / systems functional and logic programming languages. First-order br In R. A. Kowalski editor Logic Programming. Proceedings of the Fifth
98.5 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
98.5 Induction of First-Order Decision Lists: Results on Learning the Past .. - Mooney (1995)(Correct)
This paper presents a method for inducing logic programs from examples that learns
a new class of concepts called first-order decision lists, defined as ordered lists of clauses
each ending in a cut. ... / . Introduction Inductive logic programming ILP is a growing subtopic br from most work in Inductive Logic Programming a number of related pieces
98.5 Declarative Programming in Escher - Lloyd (1995)(Correct)
ion) If t is a term of type fi and x ff is a variable of type ff, then x ff :t is a term of type ff ! fi. 4. (Application) If s is a term of type ff ! fi and t is a term of type ff, then (s t) is a te... / of both functional and logic programming languages. It has types and br calls a familiar feature of logic programming languages which provides a
97.8 Directional Types And The Annotation Method - Johan Boye (1997)(Correct)
This paper shows that the annotation proof method, proposed by Deransart
for proving declarative properties of logic programs, is also applicable for
proving correctness of directional types. In parti... / method for concurrent logic programming. Here T-resolution seems to br the use of such techniques in logic programming is the multi-pass execution
97.8 Mining Association Rules in Multiple Relations - Dehaspe (1997)(Correct)
The application of algorithms for efficiently generating association
rules is so far restricted to cases where information is put together
in a single relation. We describe how this restriction can ... / from the field of inductive logic programming. We present the system br association rules inductive logic programming Introduction
97.1 Top-Down Induction Of First Order Logical Decision Trees - Blockeel (1998)(Correct)
this paper. For instance, the Progol system
(Muggleton, 1995) has recently been extended with caching and other efficiency
improvements (Cussens, 1997). Another direction of work is the use of samplin... / possibilities of inductive logic programming in the context of databases. br the application of inductive logic programming for data mining. As both
97.1 The ARANEUS Web-Base Management System - Mecca, Atzeni, Masci, Merialdo.. (1998)(Correct)
Introduction The paper describes the Araneus Web-Base Management System [1, 5, 4, 6], a system developed at Universit`a di Roma Tre, which represents a proposal towards the definition of a new kind of... / including the Database and Logic Programming Bibliography Server at br M. Ley. DataBase systems and Logic Programming bibliography site.
96.9 Static Semantics For Normal and Disjunctive Logic Programs - Przymusinski (1993)(Correct)
In this paper, we propose a new semantic framework for disjunctive logic programming
by introducing static expansions of disjunctive programs. The class of static
expansions extends both the classes o... / framework for disjunctive logic programming by introducing static br of semantic issues in logic programming and the theory of deductive
96.5 Constraint Hierarchies - Borning, Feldman-Benson, Wilson (1992)(Correct)
Constraints allow programmers and users to state declaratively a relation
that should be maintained, rather than requiring them to write procedures to maintain
the relation themselves. They are thus... / universally adopted in the logic programming community for example in br example in the Constraint Logic Programming language scheme and
96.2 Semantics of Logic Programs: Their Intuitions and Formal Properties.. - Dix (1994)(Correct)
Properties. In Luis Moniz Pereira and Anil Nerode, editors, Logic Programming and Non-Monotonic Reasoning, Proceedings of the Second International Workshop, pages 43--59. Lisbon, MIT Press, July 1993.... / logic Programs. Journal of Logic Programming - . br logic programs. Journal of Logic Programming - . War
96.2 Introducing Global Constraints in CHIP - Beldiceanu, Contejan (1994)(Correct)
The purpose of this paper is to show how the introduction of new primitive constraints (e.g. among, diffn, cycle) over finite domains in the constraint logic programming system CHIP result in finding ... / domains in the constraint logic programming system CHIP result in br by using current constraint logic programming languages. One of the main
93.6 A Deductive System for Non-Monotonic Reasoning - Eiter, Leone, Mateis, Pfeifer.. (1997)(Correct)
Disjunctive Deductive Databases (DDDBs) --- function-free disjunctive logic programs with negation in rule bodies allowed --- have been recently recognized as a powerful tool for knowledge represent... / of integrating databases with logic programming opened in the past the br database systems utilize logic programming and extensions thereof for
92.7 Concurrency and Communication in Transaction Logic - Bonner, Kifer (1996)(Correct)
In previous work, we developed Transaction Logic (or T R), which deals with state changes in deductive databases. T R provides a logical framework in which elementary database updates and queries can ... / Conference and Symposium on Logic Programming JICSLP September - br on concurrency in databases logic programming and elsewhere CT R is
92.7 Ensuring Global Termination of Partial Deduction while Allowing.. - Martens, Gallagher (1995)(Correct)
The control of polyvariance is a key issue in partial deduction of logic programs. Certainly,
only finitely many specialised versions of any procedure should be generated, while, on the
other hand, ov... / It was introduced to logic programming by and has since then br with the basic concepts in logic programming as they are presented in
91.3 Deductive Composition of Astronomical Software from Subroutine.. - Stickel, Waldinger, Lowry.. (1994)(Correct)
Automated deduction techniques are being used in a system called
Amphion to derive, from graphical specifications, programs composed
from a subroutine library. The system has been applied to construct... / Rollins and Wing RW logic programming techniques are invoked to br International Conference on Logic Programming Paris June . Smi
90.9 Separate-and-Conquer Rule Learning - Fürnkranz (1999)(Correct)
This paper is a survey of inductive rule learning algorithms that use a separate-andconquer strategy. This strategy can be traced back to the AQ learning system and still enjoys popularity as can be s... / its frequent use in inductive logic programming systems. We will put this br in the field of inductive logic programming Bergadano Gunetti
90.7 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
88.8 Two Classes of Boolean Functions for Dependency Analysis - Armstrong, Marriott, Schachte.. (1994)(Correct)
Many static analyses for declarative programming/database languages use Boolean functions
to express dependencies among variables or argument positions. Examples include
groundness analysis, arguably ... / Programming Languages Logic Programming D. . Programming br analysis of concurrent logic programming languages and
86.9 Towards a unified agent architecture that combines rationality with.. - Kowalski, Sadri (1996)(Correct)
In this paper we analyse the differences between rational and reactive agent architectures, and propose a uniform agent architecture that aims to capture both as special cases. For this purpose we emp... / elsewhere to unify abductive logic programming constraint logic br logic programming constraint logic programming and semantic query
86.9 Principles And Implementation Of Deductive Parsing - Shieber (1995)(Correct)
We present a system for generating parsers based directly on the metaphor of parsing as deduction. Parsing algorithms can be represented directly as deduction systems, and a single deduction engine ca... / J. Logic Programming - br Nj . The Journal Of Logic Programming C Flelsevier Science
86.2 A Finite Presentation Theorem for Approximating Logic Programs.. - Heintze, al. (1990)(Correct)
Nevin Heintze Joxan Jaffar
School of Computer Science IBM T.J. Watson Research Center
Carnegie Mellon University PO Box 218
Pittsburgh, PA 15213 Yorktown Heights, NY 10598
Summary
The notion of c... / unifiers. The relevant area in logic programming is that of type inference br that on type inference in logic programming. The main result that our
85.7 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
85.7 Learning First-Order Acyclic Horn Programs from Entailment - Reddy, Tadepalli (1998)(Correct)
In this paper, we consider learning first-order Horn programs
from entailment. In particular, we show that any subclass of first-order
acyclic Horn programs with constant arity is exactly learnable ... / problem in inductive logic programming with applications ranging br J. Foundations of Logic Programming nd ed.Springer-Verlag
85.1 Event Calculus Planning Revisited - Shanahan (1997)(Correct)
In 1969 Cordell Green presented his seminal
description of planning as theorem proving with the
situation calculus. The most pleasing feature of Green's
account was the negligible gap between high-lev... / formalism and employ abductive logic programming as our theorem proving br is to sketch the use of logic programming techniques to render the
84.0 The execution algorithm of Mercury, an efficient purely declarative.. - Zoltan Somogyi (1996)(Correct)
We introduce Mercury, a new purely declarative logic programming language designed to provide the support that
groups of application programmers need when building large programs. Mercury's strong typ... / efficient purely declarative logic programming language Zoltan Somogyi br a new purely declarative logic programming language designed to provide
84.0 Bag of words and word psitions - Cohen (1995)(Correct)
Text categorization is the task of classifying text into one of several predefined categories. In this paper we will evaluate the effectiveness of several ILP methods for text categorization, and also... / IJCAI Workshop on Inductive Logic Programming Chambery France . br models. In Inductive Logic Programming. Academic Press .
83.9 Mixed Integer Programming Methods for Computing Nonmonotonic.. - Bell (1994)(Correct)
Though the declarative semantics of both explicit and nonmonotonic negation in logic
programs has been studied extensively, relatively little work has been done on computation
and implementation of th... / Preliminaries . Basic Logic Programming Notions In this section br four alternative semantics for logic programming with classical negation.
83.9 Efficient Top-Down Computation Of Queries Under The Well-Founded.. - Chen (1994)(Correct)
This paper investigates two major implementation issues of query evaluation under the well-founded semantics, namely (a) to ensure that negative literals be resolved only after their positive counterp... / J. Logic Programming - br Ccr- . The Journal Of Logic Programming C Flelsevier Science
82.4 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
82.4 Object-Oriented Concurrent Constraint Programming in Oz - Henz, Smolka, Würtz (1993)(Correct)
Oz is a higher-order concurrent constraint programming system under
development at DFKI. It combines ideas from logic and concurrent programming
in a simple yet expressive language. From logic program... / yet expressive language. From logic programming Oz inherits logic variables br employed in concurrent logic programming. Based on cells and
81.8 Type Inference with Constrained Types - Odersky, Sulzmann, Wehr (1999)(Correct)
this paper we present a general
framework HM(X) for Hindley/Milner style type systems
with constraints, analogous to the CLP(X) framework
in constraint logic programming [JM94]. Particular
type system... / framework in constraint logic programming JM Particular type br and Michael Maher. Constraint logic programming A survey. Journal of
81.0 Possibilistic logic - Dubois, Lang, Prade (1992)(Correct)
This paper is organized as follows : Section 2 pursues the overview by introducing background material on fuzzy set and possibility theory, including comparative possibility relations that underlie po... / and gave birth to logic programming tools Mukaidono et al. br discrete optimization and logic programming. . Possibility theory
80.8 Solving Small TSPs with Constraints - Caseau, Laburthe (1997)(Correct)
This paper presents a set of techniques that makes constraint programming
a technique of choice for solving small (up to 30 nodes) traveling salesman
problems. These techniques include a propagation s... / the th Int. Conf. on Logic Programming MIT Press . Y. br An Exact Constraint Logic Programming Algorithm for the Travelling
80.4 A Closed Form Evaluation For Datalog Queries With Integer (GAP)-Order .. - Revesz (1993)(Correct)
We provide a generalization of Datalog based on generalizing databases
by adding integer order constraints to relational tuples. For Datalog queries with integer
(gap)-order constraints (denoted Dat... / tuple comes from constraint logic programming systems e.g. CLP br Generalizations. Journal of Logic Programming - . J.
79.9 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
79.9 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
78.2 Comparative Experiments on Disambiguating Word Senses: An.. - Mooney (1996)(Correct)
This paper describes an experimental comparison
of seven different learning algorithms on the
problem of learning to disambiguate the meaning
of a word from context. The algorithms tested
include stat... / Brill and inductive logic programming Zelle Mooney to br demonstrated that an inductive logic programming method produces even better
78.2 A Circumscriptive Calculus of Events - Shanahan (1995)(Correct)
A calculus of events is presented in which domain constraints,
concurrent events, and events with non-deterministic effects can be
represented. The paper offers a non-monotonic solution to the frame
p... / taken out of the framework of logic programming and augmented with a br Artificial Intelligence and Logic Programming Volume Nonmonotonic
76.5 Map Labeling and Its Generalizations - Doddi, Marathe, Mirzaian, Moret, Zhu (1997)(Correct)
Map labeling is of fundamental importance in cartography and geographical information systems
and is one of the areas targeted for research by the ACM Computational Geometry Impact
Task Force. Previou... / artificial intelligence and logic programming see for instance Jo
76.5 PROTEIN: A PROver with a Theory Extension INterface - Peter Baumgartner, Ulrich Furbach (1994)(Correct)
PROTEIN (PROver with a Theory Extension INterface) is a PTTPbased
first order theorem prover over built-in theories. Besides various standardrefinements
known for model elimination, PROTEIN also off... / interpreter for disjunctive logic programming. PROTEIN includes br of the th Int. Conf. on Logic Programming pages - . The MIT
75.3 A Generalization of Analytic Deduction via Labelled Deductive Systems .. - D'Agostino, Gabbay (1995)(Correct)
In this series of papers we set out to generalize the notion of classical analytic deduction (i.e. deduction via elimination rules) by combining the methodology of Labelled Deductive Systems [Gab94] w... / artificial intelligence and logic programming. In these fields there is a br Handbook of Logic in AI and Logic Programming. Oxford University Press
75.0 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
74.2 Relationlog: A Typed Extension to Datalog with Sets and Tuples - Liu (1998)(Correct)
This paper presents a novel logic programming based language for nested
relational and complex value models called Relationlog. It stands in the
same relationship to the nested relational and complex ... / J. Logic Programming - br .This paper presents a novel logic programming based language for nested
74.2 Theorem Proving Modulo - Dowek, Hardin, Kirchner (1998)(Correct)
Theorem proving modulo" is a way to remove computational arguments from proofs by reasoning modulo a congruence on propositions. Such a technique, issued from automated theorem proving, is of wider i... / spread with constraint logic programming JL and then constraint br integration of functions into logic programming From theory to practice.
74.2 COCA: Collaborative Objects Coordination Architecture - Li (1998)(Correct)
Coordination policies vary from collaboration to collaboration and are even subject to evolution in different phases of the same collaboration. It is vital for collaborative systems to be flexible eno... / Coordination Languages Logic Programming Distributed Systems br Research results from the logic programming community may be adopted
74.0 Minimal Belief and Negation as Failure - Lifschitz (1994)(Correct)
Fangzhen Lin and Yoav Shoham defined a propositional nonmonotonic
logic which uses two independent modal operators. One of them represents
minimal knowledge, the other is related to the ideas of justi... / and default logic to logic programming and to the theory of br as well as some logic programming languages. This work can be
72.4 A Linear Logical Framework - Cervesato, Pfenning (1996)(Correct)
We present the linear type theory LLF as the forThis extended abstract will appear on the proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science --- LICS'96, New Brunswick, NJ,... / interpretation as a logic programming language under which the br efficient implementation as a logic programming language in the style of
72.4 Algebraic Properties of Idempotent Substitutions - Palamidessi (1996)(Correct)
This paper presents an algebra of idempotent substitutions whose operations
have many properties. We provide an algorithm to compute these operations
and we show how they are related to the standard c... / composition. The theory of Logic Programming can be rewritten in terms of br for a theory of concurrent logic programming. Introduction. A nice
72.3 Towards Constraint Satisfaction through Logic Programs and the Stable .. - Simons (1997)(Correct)
Logic programs with the stable model semantics can be thought of as a new paradigm for constraint satisfaction, where the rules of a program are seen as constraints on the stable models. In this work ... / stable model semantics logic programming nonmonotonic reasoning br of stable models is not logic programming as query evaluation the
72.3 ECLiPSe: A Platform for Constraint Logic Programming - Wallace, Novello, Schimpf (1997)(Correct)
This paper introduces the Constraint Logic Programming (CLP) platform ECLiPSe. ECLiPSe is designed to be more than an implementation of CLP: it also supports mathematical programming and stochastic pr... / A Platform for Constraint Logic Programming Mark Wallace Stefano br introduces the Constraint Logic Programming CLP platform ECL i
71.6 Foundations of Aggregation Constraints - Ross, Srivastava, Stuckey, Sudarshan (1994)(Correct)
We introduce a new constraint domain, aggregation constraints, that is useful in
database query languages, and in constraint logic programming languages that incorporate
aggregate functions. We formal... / languages and in constraint logic programming languages that incorporate br languages and in constraint logic programming languages that incorporate
71.6 Mutagenesis: ILP experiments in a non-determinate biological domain - Srinivasan, Muggleton, King.. (1994)(Correct)
This paper describes the use of Inductive Logic Programming as a scientific assistant. In particular, it details the application of the ILP system Progol to discovering structural features that can re... / describes the use of Inductive Logic Programming as a scientific assistant. br knowledge an Inductive Logic Programming tool firstly complements a
70.5 Andorra-I: A Parallel Prolog System that Transparently Exploits both.. - Costa, Warren, Yang (1991)(Correct)
Andorra-I is an experimental parallel Prolog system that transparently exploits both dependent and-parallelism and or-parallelism. It constitutes the first implementation of the Basic Andorra model, a... / written in Prolog and other logic programming languages it is somewhat br non-deterministic parallel logic programming. In Proceedings of the
69.5 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
69.1 Partial Deduction of Disjunctive Logic Programs: A Declarative.. - Sakama (1994)(Correct)
This paper presents a partial deduction method for disjunctive
logic programs. We first show that standard partial deduction in
logic programming is not applicable as it is in the context of disjunc... / standard partial deduction in logic programming is not applicable as it is br optimization techniques in logic programming. Given a logic program
68.2 Kernel Andorra Prolog And Its Computation Model - Haridi, Janson (1990)(Correct)
The logic programming language framework Kernel Andorra Prolog is defined
by a formal computation model. In Kernel Andorra Prolog, general combinations
of concurrent reactive languages and nondetermin... / ABSTRACT The logic programming language framework Kernel br time now the main efforts of logic programming language-design and
68.0 A Semantic Basis for the Termination Analysis of Logic Programs - Codish, Taboch (1997)(Correct)
This paper presents a formal semantic basis for the termination analysis
of logic programs. The semantics exhibits the termination properties of
a logic program through its binary unfoldings --- a pos... / readily available constraint logic programming techniques. A working br implemented using constraint logic programming technology. The analysis
68.0 Mechanizing Coinduction and Corecursion in Higher-order Logic - Paulson (1997)(Correct)
A theory of recursive and corecursive definitions has been developed in higher-order logic
(HOL) and mechanized using Isabelle. Least fixedpoints express inductive data types such
as strict lists; gre... / HOL etc. Isabelle has logic programming features such as
68.0 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
67.2 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
66.6 Asynchronous Communication Model Based on Linear Logic - Kobayashi (1995)(Correct)
We propose a new framework called ACL for concurrent computation based on linear logic. ACL is a kind of linear logic programming framework, where its operational semantics is described in terms of pr... / ACL is a kind of linear logic programming framework where its br of techniques for traditional logic programming. ACL's attractive features
66.6 Programming in Lygon: An Overview - Harland, Pym, Winikoff (1995)(Correct)
For many given systems of
logic, it is possible to identify, via systematic
proof-theoretic analyses, a fragment
which can be used as a basis for a
logic programming language. Such analyses
have be... / can be used as a basis for a logic programming language. Such analyses br the definition of the linear logic programming language Lygon. It
65.5 Computing Least Common Subsumers in Description Logics - Cohen, Borgida, Hirsh (1992)(Correct)
Description logics are a popular formalism for knowledge representation and reasoning. This paper introduces a new operation for description logics: computing the "least common subsumer" of a pair of ... / between two other concepts. In logic programming similar operations called
64.1 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
64.1 Computation of Stable Models and its Integration with Logical Query.. - Chen, Warren (1994)(Correct)
The well-founded semantics and the stable model semantics capture intuitions of the skeptical and credulous semantics in nonmonotonic reasoning, respectively. They represent the two dominant proposals... / Logic Deductive Database Logic Programming Nonmonotonic Reasoning br Contributions to the theory of logic programming. JACM -
64.1 Distributed Programming with Logic Tuple Spaces - Ciancarini (1994)(Correct)
s are available from the same host in the directory /pub/TR/UBLCS/ABSTRACTS in plain text format. All local authors can be reached via e-mail at the address last-name@cs.unibo.it. UBLCS Technical Repo... / April . - What is Logic Programming good for in Software br combination of Linda with a logic programming language. We are interested
63.8 Solving Linear Arithmetic Constraints for User Interface Applications - Borning, Marriott (1997)(Correct)
Linear equality and inequality constraints arise naturally in
specifying many aspects of user interfaces, such as requiring
that one window be to the left of another, requiring that a pane
occupy the ... / for implementing constraint logic programming languages. . Overview br solvers has been in the logic programming and constraint logic
63.8 A New Approach to Integrating Mixed Integer Programming and.. - Rodosek, Wallace, Hajian (1997)(Correct)
This paper represents an integration of Mixed Integer Programming (MIP) and
Constraint Logic Programming (CLP) which, like MIP, tightens bounds rather
than adding constraints during search. The integr... / Programming and Constraint Logic Programming Robert Rodo sek Mark G. br MIP and Constraint Logic Programming CLP which like MIP
63.7 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
63.7 Pac-learning Recursive Logic Programs: Negative Results - Cohen (1995)(Correct)
In a companion paper it was shown that the class of constant-depth determinate k-ary recursive clauses is efficiently learnable. In this paper we present negative results showing that any natural gene... / . Introduction Inductive logic programming ILP Muggleton br system are expressed in a logic programming language. While many
63.7 On the Declarative and Procedural Semantics of Deductive.. - Dobbie, Topor (1995)(Correct)
We present declarative and procedural semantics for a deductive object-oriented language,
Gulog. The declarative semantics is based on preferred minimal models. We describe both
bottom-up and top-do... / by a translation to a logic programming language thus providing br are similar to those in logic programming except that in Gulog we
63.7 Disjunctive Semantics based upon Partial and Bottom-Up Evaluation - Stefan Brass, Jürgen Dix (1995)(Correct)
We present a new and general approach of defining semantics for disjunctive
logic programs. Our framework consists of two parts: (1) a semantical ,
where semantics are defined in an abstract way as th... / Abstract properties of logic programming semantics were extensively br the abstract properties of logic programming semantics that we need and
63.6 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
62.0 PAC-Learnability of Determinate Logic Programs - Dzeroski, Muggleton, Russell (1992)(Correct)
The field of Inductive Logic Programming
(ILP) is concerned with inducing logic programs
from examples in the presence of background
knowledge. This paper defines the ILP
problem, and describes the v... / The field of Inductive Logic Programming ILP is concerned with br has been named Inductive Logic Programming ILP Muggleton
62.0 Generalization and Learnability: A Study of Constrained Atoms - Page, Jr., Frisch (1992)(Correct)
This paper studies the generalization of atomic formulas, or atoms, that are augmented with constraints on or among their terms. The atoms may also be viewed as definite clauses whose antecedents expr... / Stephen H. Ed Inductive Logic Programming. London Academic Press br From a constraint logic programming point of view an atomic
61.8 Equational Reasoning and Term Rewriting Systems - Plaisted (1993)(Correct)
ordering structures and computational complexity. Technical
Report CSD-TR-621, University of London, May 1990.
[Che81] P. Chew. Unique normal forms in term rewriting systems with repeated variables. I... / Logic programming and narrowing br in Artificial Intelligence and Logic Programming volume edited by Dov
61.7 Deriving Incremental Production Rules for Deductive Data - Ceri, Widom (1994)(Correct)
We show that the production rule mechanism provided by active database systems can be
used to quickly and easily implement the logic rule interface of deductive database systems.
Deductive rules speci... / deductive database systems logic programming style rules are used to br G. Gottlob and L. Tanca. Logic Programming and Databases.
61.7 A Foundation for Higher-order Concurrent Constraint Programming - Gert Smolka (1994)(Correct)
We present the fl-calculus, a computational calculus for higher-order concurrent
programming. The calculus can elegantly express higher-order functions (both eager
and lazy) and concurrent objects wit... / solving in the style of logic programming. A such extended br Its roots are concurrent logic programming and constraint logic
60.8 Coreference and Modality - Groenendijk (1996)(Correct)
this paper is devoted to an analysis of a specific problem
area, which is not only of interest descriptively, but which also presents an
interesting theoretical challenge.
The descriptive area is that... / of so-called declarative logic'programming languages the notion of a
60.8 Lazy Narrowing: Strong Completeness and Eager Variable Elimination - Middeldorp, Okui, Ida (1995)(Correct)
Narrowing is an important method for solving unification problems in
equational theories that are presented by confluent term rewriting systems.
Because narrowing is a rather complicated operation, se... / mechanism of many functional-logic programming languages see Hanus for br integration of functional and logic programming It is well-known that
60.3 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
59.7 Strong Termination of Logic Programs - Bezem (1993)(Correct)
this paper appeared as [B].
1. INTRODUCTION
Termination of logic programs is of course of utmost importance. The question whether the top-down
evaluation of a goal G terminates with respect to a logic... / Key Words Phrases logic programming termination recursion br and notation concerning logic programming we refer the reader to A
59.5 Lookahead and Discretization in ILP - Blockeel, De Raedt (1997)(Correct)
We present and evaluate two methods for improving the performance
of ILP systems. One of them is discretization of numerical attributes,
based on Fayyad and Irani's text [9], but adapted and extende... / extensively than inductive logic programming ILP and at this moment br paradigm for inductive logic programming introduced by and
59.5 Partial Classification using Association Rules - Ali, Manganaris, Srikant (1997)(Correct)
Many real-life problems require a partial classification
of the data. We use the term "partial classification"
to describe the discovery of models that show characteristics
of the data classes, but ma... / the use of existing inductive logic programming ILP techniques Muggleton br S.ed. . Inductive Logic Programming. Academic Press. Nearhos
59.0 Constraint Hierarchies and Logic Programming - Borning, Maher, Martindale, Wilson (1989)(Correct)
Constraint Logic Programming (CLP) is a general scheme for extending logic programming to include constraints. It is parameterized by D, the domain of the constraints. However, CLP(D) languages, as we... / Constraint Hierarchies and Logic Programming Alan Borningy Michael br Abstract Constraint Logic Programming CLP is a general scheme
57.9 Structural Regression Trees - Kramer (1996)(Correct)
In many real-world domains the task of machine learning algorithms is
to learn a theory predicting numerical values. In particular several standard
test domains used in Inductive Logic Programming (IL... / Inductive Learning Inductive Logic Programming Regression Abstract br test domains used in Inductive Logic Programming ILP are concerned with
57.9 Learning First-Order Definitions of Functions - Quinlan (1996)(Correct)
First-order learning involves finding a clause-form definition of a relation from examples of the relation and relevant background information. In this paper, a particular first-order learning system ... / is sometimes called inductive logic programming Muggleton Lavrac br Workshop on Inductive Logic Programming Bled Slovenia pp.
57.9 Representing Priorities in Logic Programs - Sakama, Inoue (1996)(Correct)
Reasoning with priorities is a central topic in knowledge representation. A number of techniques for prioritized reasoning have been developed in the field of AI, but existing logic programming lacks ... / the field of AI but existing logic programming lacks the mechanism of br for representing priorities in logic programming. Prioritized logic
57.9 Static Analysis of Communication for Asynchronous Concurrent.. - Kobayashi (1995)(Correct)
We propose an effect-based static analysis technique on communication for asynchronous concurrent programming languages. Our analysis gives an upper-bound of the number of enqueued messages and rece... / languages concurrent logic programming languages and Concurrent br Interpretation of Linear Logic Programming in Proceedings of
57.7 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
57.7 Implementation of the CORAL Deductive Database System - Ramakrishnan, Srivastava, Sudarshan, .. (1993)(Correct)
CORAL is a deductive database system that supports a rich declarative language, provides a wide range of evaluation methods, and allows a combination of declarative and imperative programming. The dat... / semantics with those of a logic programming language such as more br technology. In comparison to logic programming systems such as various
57.7 Applying Techniques to Skeletons - Sterling, Kirschenbaum (1993)(Correct)
This paper concerns our research on developing a theory and methodology appropriate
for systematically building complicated Prolog programs. Programs are constructed
procedurally from standard compone... / with the declarative ideal of logic programming if well structured programs br Dev Yves Deville. Logic Programming Systematic Program
57.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.
57.1 Learning Function-Free Horn Expressions - Khardon (1998)(Correct)
The problem of learning universally quantified function free first order Horn
expressions is studied. Several models of learning from equivalence and membership
queries are considered, including the m... / learner as done in Inductive Logic Programming and the model where the br in framework of Inductive Logic Programming see e.g. Muggleton De
57.1 Execution Monitoring of High-Level Robot Programs. - De Giacomo, Reiter, al. (1998)(Correct)
Imagine a robot that is executing a program
on-line, and, insofar as it is reasonable to do
so, it wishes to continue with this on-line
program execution, no matter what exogenous
events occur in the ... / interpreter for the logic programming language Golog The br extended in Golog is a logic-programming language whose primitive
57.1 Combining Statistical and Relational Methods for Learning in.. - Slattery, Craven (1998)(Correct)
We present a new approach to learning hypertext classifiers that combines a statistical text-learning method with a relational rule learner. This approach is well suited to learning in hypertext dom... / Conference on Inductive Logic Programming Springer-Verlag . br Advances in Inductive Logic Programming. IOS Press . . M.
56.8 Generalized Sufficient Conditions for Modular Termination of Rewriting - Gramlich (1992)(Correct)
Modular properties of term rewriting systems, i.e. properties
which are preserved under disjoint unions, have attracted an increasing
attention within the last few years. Whereas confluence is modul... / Int. Conf. on Algebraic and Logic Programming Pisa Italy volume of br International Conference on Logic Programming and Automated Reasoning
56.7 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
56.7 On Proof Normalization in Linear Logic - Galmiche, Perrier (1994)(Correct)
We present a proof-theoretic foundation for automated deduction in linear logic. At first,
we systematically study the permutability properties of the inference rules in this logical
framework and exp... / construction and design of logic programming languages based on linear br have in different domains as logic programming or program synthesis through
56.7 On the Occur-check Free Prolog Programs - Apt, Pellegrini (1994)(Correct)
Machine
is used. This tag maintains information about the context in which a variable
is used. This makes possible to optimize the generated code by avoiding calls to
the occur-check routine at the co... / and theorem proving-logic programming General terms Languages br is replaced by the logic programming i Consider the