Home     Top: Theory: Logic    [Computational Complexity   Formal Languages   Logic   Quantum Computing   Theorem Proving]

Change ordering:   Authority   Hubs (tutorials)   Date   Expected authority       Show titles only
Ordered by the number of citations

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.

631   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

394   Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams - Bryant (1992)   (Correct)
Introduction to VLSI Systems, Addison-Wesley, Reading, MA. [Meinel 1990] Meinel, C. 1990 Modified branching programs and their computational power, Lecture Notes in Computer Science Vol. 370, G. Goos... / Boolean expressions into logic programming. Journal of Symbolic

259   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

255   Pushing the Envelope: Planning, Propositional Logic, and Stochastic.. - Kautz, Selman (1996)   (Correct)
Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to scale up gracefully. By combining a general, stochastic search algorithm a... / information as occurs in logic programming. Instead we are suggesting

240   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

230   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

227   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

200   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

196   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

190   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

183   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

179   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

179   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

139   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

133   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

118   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

115   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 -

108   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

99   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

90   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

90   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

90   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

86   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

86   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

84   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

81   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 - .

75   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

72   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

71   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

68   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

64   Predicate Migration: Optimizing Queries with Expensive Predicates - Hellerstein (1992)   (Correct)
The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers by "predicate pushdo... / in the context of the LDL logic programming system CGK Their

64   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

62   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

60   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

59   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

59   The Zinc Experiment: An Economical Implementation Of The Ml Language - Leroy (1990)   (Correct)
This report details the design and implementation of the ZINC system. This is an implementation of the ML language, intended to serve as a test field for various extensions of the language, and for ne... / paradigms such as logic programming object-oriented

58   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

57   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

56   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

56   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

55   Elf: A Language for Logic Definition and Verified Metaprogramming - Pfenning (1989)   (Correct)
We describe Elf, a metalanguage for proof manipulation environments that are independent of any particular logical system. Elf is intended for meta-programs such as theorem provers, proof transformers... / Logical Framework with logic programming in the style of Prolog br This is in contrast to logic programming languages where executing

54   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

54   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

54   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

52   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

52   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

52   Using Typed Lambda Calculus to Implement Formal Systems on a Machine - Avron, Honsell, Mason, Pollack (1992)   (Correct)
this paper and the LF. In particular the idea of having an operator T : Prop ! Type appears already in De Bruijn's earlier work, as does the idea of having several judgements. The paper [24] describes... / Provers in a Higher-Order Logic Programming Language PhD thesis br Provers in a Higher-Order Logic Programming Language. in Ninth

51   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

51   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

50   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

50   Efficient Implementation of the Well-founded and Stable Model.. - Niemelä, Simons (1996)   (Correct)
An implementation of the well-founded and stable model semantics for range-restricted function-free normal programs is presented. It includes two modules: an algorithm for implementing the two semanti... / alternative semantics for logic programming and non-monotonic reasoning. br rd International Workshop on Logic Programming and Non-monotonic

50   Mechanizing Programming Logics in Higher Order Logic - Gordon (1988)   (Correct)
Formal reasoning about computer programs can be based directly on the semantics of the programming language, or done in a special purpose logic like Hoare logic. The advantage of the first approach is... / J.C. eds Mathematical Logic and Programming Languages Prentice br Mechanizing Programming Logics in Higher Order Logic

49   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

48   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

48   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

47   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

47   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

47   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

45   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 - .

44   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

43   Relational Learning of Pattern-Match Rules for Information Extraction - Califf, Mooney (1997)   (Correct)
Information extraction is a form of shallow text processing that locates a specified set of relevant items in a natural-language document. Systems for this task require significant domain-specific kno... / from several inductive logic programming systems and acquires br inspired by several Inductive Logic Programming ILP systems and primarily

42   Information Extraction from HTML: Application of a General Machine.. - Freitag (1998)   (Correct)
Because the World Wide Web consists primarily of text, information extraction is central to any effort that would use the Web as a resource for knowledge discovery. We show how information extraction ... / otherwise known as inductive logic programming comprises a set of

41   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

40   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

40   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

40   Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture - Kamath, Motwani, Palem, Spirakis (1995)   (Correct)
The classical occupancy problem is concerned with studying the number of empty bins resulting from a random allocation of m balls to n bins. We provide a series of tail bounds on the distribution of t... / VLSI design and testing logic programming inference machine

40   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

39   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

39   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

39   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.

39   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

38   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

38   Inductive Assertion Method For Logic Programs - Drabent, Maluszynski (1988)   (Correct)
Certain properties of logic programs are inexpressible in terms of their declarative semantics. One example of such properties would be the actual form of procedure calls and successes which occur dur... / with foundations of logic programming as presented for instance br The language of clauses the logic programming language will be referred

38   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

37   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

36   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

36   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

36   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

35   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.

35   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

35   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 .

35   A Logical Approach to High-Level Robot Programming - A Progress Report - Lesperance, Levesque, Lin, al. (1994)   (Correct)
This paper describes a novel approach to high-level robot programming based on a highly developed logical theory of action. The user provides a specification of the robot's basic actions (their precon... / result will be GOLOG a novel logic programming language suitable for

34   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.

34   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

34   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

34   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

34   Data Mining using MLC++ - A Machine Learning Library in C++ - Kohavi, Sommerfield, Dougherty (1997)   (Correct)
Data mining algorithms including machine learning, statistical analysis, and pattern recognition techniques can greatly improve our understanding of data warehouses that are now becoming more widespre... / Vazirani Inductive Logic Programming models Lavrac Dzeroski br S. Inductive logic programming Techniques and

34   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

34   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

33   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

33   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

32   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

32   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

32   Caching and Lemmaizing in Model Elimination Theorem Provers - Astrachan (1992)   (Correct)
Theorem provers based on model elimination have exhibited extremely high inference rates but have lacked a redundancy control mechanism such as subsumption. In this paper we report on work done to m... / techniques developed by the logic programming community hence the name br of Deductive Databases and Logic Programming chapter pages

31   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-

31   Compiling Prior Knowledge Into an Explicit Bias - Cohen (1992)   (Correct)
Current theory-guided learning systems are inflexible, in that they are committed to performing one particular class of theory corrections; this is problematic because in some cases special-purpose th... / by standard inductive logic programming techniques. FOCL on the

31   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

30   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

30   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

30   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

30   Definitional Trees - Antoy (1992)   (Correct)
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure representing, at a high level of abstraction, a form of control. Its appl... / and lazy evaluation in logic programming. In T. P. Clement and K.K. br and M. Rodr'iguez-Artalejo. Logic programming with functions and

30   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

29   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

29   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

29   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

29   Schema-Based Transformations of Logic Programs - Fuchs (1991)   (Correct)
ion Selection Specialization P1/A1 Pn/An S1/G 1 Sn/G n S/G P/A 8 Abstraction For each program P i (i=1, ... , n) we identify a program schema S i which describes P i abstractly. This abstraction... / Introduction Logic programming allows to write software br be efficiently executable. Logic programming promises to bridge the

29   Foundations of Aggregation Constraints - Ross, Srivastava, Stuckey, Sudarshan (1994)   (Correct)
We introduce a new constraint domain, aggregation constraints, which is useful in database query languages, and in constraint logic programming languages that incorporate aggregate functions. We stu... / languages and in constraint logic programming languages that incorporate br constraints in a constraint logic programming system like CLP R

29   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 .

28   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

28   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

28   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

28   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

28   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

28   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

27   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

27   Proof Search in the Intuitionistic Sequent Calculus - Shankar (1991)   (Correct)
The use of Herbrand functions (more popularly known as Skolemization) plays an important role in classical theorem proving and logic programming. We define a notion of Herbrand functions for the full ... / classical theorem proving and logic programming. We define a notion of br a framework for generalizing logic programming to subsets of intuitionistic

27   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

27   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

27   System Description: Twelf -- A Meta-Logical Framework for Deductive.. - Frank Pfenning, Carsten Schürmann (1999)   (Correct)
Twelf is a meta-logical framework for the specification, implementation, and meta-theory of deductive systems from the theory of programming languages and logics. It relies on the LF type theory and... / HHP a constraint logic programming interpreter for br algorithms by a constraint logic programming interpretation of LF

27   A Semi-Functional Implementation of a Higher-Order Logic Programming.. - Elliott (1991)   (Correct)
ions *) and varbind = Varbind of string * term (* Variable binders , Type *) In the implementation of the term language and the type checker, we have two constants type and pi. And, yes, type is a typ... / of a Higher-Order Logic Programming Language Conal Elliott br of a higher-order constraint logic programming language in Standard ML

26   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

26   Reform Prolog: The Language and its Implementation - Bevemyr, Lindgren, Millroth (1993)   (Correct)
Reform Prolog is an (dependent) AND-parallel system based on recursionparallelism and Reform compilation. The system supports selective, userdeclared, parallelization of binding-deterministic Prolog p... / Most systems for AND-parallel logic programming defines the procedural br in Proc. th Int. Conf. Logic programming MIT Press . .

26   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

26   Unification and Anti-Unification in the Calculus of Constructions - Pfenning (1991)   (Correct)
We present algorithms for unification and antiunification in the Calculus of Constructions, where occurrences of free variables (the variables subject to instantiation) are restricted to higher-order ... / development environments and logic programming languages. This has lead to br as the basis for the logic programming language L This class

26   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 -

26   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

26   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

25   A Linear Logical Framework - Cervesato, Pfenning (1996)   (Correct)
We present the linear type theory \Pi\Gammaffi&? as the formal basis for LLF, a conservative extenSubmitted to Information & Computation. Comments are welcome! sion of the logical framework LF . LLF c... / as the higherorder constraint logic programming language Elf Pfe br of this formalism as a logic programming language require considering

25   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

25   A taste of linear logic - Wadler (1993)   (Correct)
This tutorial paper provides an introduction to intuitionistic logic and linear logic, and shows how they correspond to type systems for functional languages via the notion of `Propositions as Types... / applications such as logic programming or concurrent programming. br foundation for directional logic programming. In E. Lamma and P. Mello

25   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.

25   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

24   String Variable Grammar: A Logic Grammar Formalism For The Biological .. - Searls (1993)   (Correct)
this paper, we present a generalized form of SVG, which supports additional biologically-relevant operations by going beyond homomorphisms, instead uniformly applying substitutions in either a forward... / J. Logic Programming - String br Pa . The Journal Of Logic Programming C Flelsevier Science

24   Formalizing Database Evolution in the Situation Calculus - Reiter (1992)   (Correct)
We continue our exploration of a theory of database updates (Reiter [21, 23]) based upon the situation calculus. The basic idea is to take seriously the fact that databases evolve in time, so that upd... / topics specifically . A logic programming implementation of query br in this paper . We sketch a logic programming implementation of the axioms

24   Declarative Definition of Object-Oriented Multidatabase Mappings - Chomicki, Litwin (1993)   (Correct)
We propose a language for declarative specification of mappings between different object-oriented multidatabases. The language is based on OSQL, the query language of the IRIS OODBMS. We also outline ... / powerful higher-order logic programming language KLW BG br Instance is used here in the logic programming sense instance of a

24   Modeling answer constraints in Constraint Logic Programs - Gabbrielli, Levi (1991)   (Correct)
The constraint logic programming paradigm CLP(X) (CLP for short) has been proposed by Jaffar and Lassez in order to integrate a generic computational mechanism based on constraints with the logic prog... / Abstract The constraint logic programming paradigm CLP X CLP for br based on constraints with the logic programming framework. This paradigm

24   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

24   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

24   Controlling the Search in Bottom-Up Evaluation - Ramakrishnan, Srivastava, Sudarshan (1992)   (Correct)
Bottom-up evaluation of queries on deductive databases has many advantages over an evaluation scheme such as Prolog. It is sound and complete with respect to the declarative semantics of least Herbran... / We assume familiarity with logic programming terminology see and br query evaluation. Journal of Logic Programming September .

24   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

24   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

23   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

23   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

23   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

23   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

23   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

23   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

23   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

23   Conjunto: Constraint Logic Programming with Finite Set Domains - Gervet (1994)   (Correct)
Combinatorial problems involving sets and relations are currently tackled by integer programming and expressed with vectors or matrices of 0-1 variables. This is efficient but not flexible and unnatur... / Conjunto Constraint Logic Programming with Finite Set Domains br and defined in the constraint logic programming language CHIP Such a

23   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

22   Reforming Compilation of Logic Programs - Millroth (1991)   (Correct)
We present a new method for parallel logic programming which is based on compilation of Tarnlund's inference system Reform. The idea is to compile recursively defined programs to parallel iterative ... / a new method for parallel logic programming which is based on br is a new inference system for logic programming that employs program

22   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

22   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

22   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

22   Magic Sets and Bottom-up Evaluation of Well-Founded Models - Kemp, Stuckey (1991)   (Correct)
We present a bottom-up operational procedure for computing well-founded models of allowed DATALOG programs with negation. This procedure provides a practical method of handling programs that involve u... / We assume familiarity with logic programming terminology see For br of Deductive Databases and Logic Programming - .

22   Nogood Recording for Static and Dynamic Constraint Satisfaction.. - Schiex, Verfaillie (1994)   (Correct)
Many AI synthesis problems such as planning, scheduling or design may be encoded in a constraint satisfaction problems (CSP). A CSP is typically defined as the problem of finding any consistent labeli... / expert systems or constraint logic programming. It offers a simple natural br search in contraint logic programming New Generation Computing

22   Combining Symbolic Constraint Solvers on Algebraic Domains - Kirchner, Ringeissen (1994)   (Correct)
ion An atomic constraint p ? (t 1 ; : : : ; t m ) is decomposed into a conjunction of pure atomic constraints by introducing new equations of the form (x = ? t), where t is an alien subterm in the con... / In the context of constraint logic programming and theorem proving the br In the context of logic programming and deduction with

22   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

22   Arc-Consistency and Arc-Consistency Again - Bessière, Cordier (1994)   (Correct)
There is no need to show the importance of arc-consistency in Constraint Networks. Mohr and Henderson [8] have proposed AC-4, an algorithm having an optimal worst-case time complexity. But it has two ... / Constraint Logic Programming CLP languages which br some applications constraint logic programming temporal reasoning

22   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

22   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

22   Refinement Types for Logical Frameworks - Frank Pfenning (1993)   (Correct)
We propose a refinement of the type theory underlying the LF logical framework by a form of subtypes and intersection types. This refinement preserves desirable features of LF, such as decidability of... / hypothetical judgments. The logic programming language Elf Pfe a br calculi and their use in logic programming and automated theorem

21   Stationary Default Extensions - Przymusinska, Prymusinski (1992)   (Correct)
this paper we introduce the class of so called stationary extensions of a default theory. Stationary extensions include, as a special case, Reiter's original default extensions but allow us to elimina... / logic is closely related to logic programming. Bidoit and Froidevaux br but it also allows us to use logic programming as an inference engine for

21   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

21   A System For Specialising Logic Programs - Gallagher (1991)   (Correct)
This report describes SP, a system for specialising logic programs. The report functions as a user's manual for SP, and also contains the algorithms employed and arguments for their correctness. A num... / shown by the practicality of logic programming. Here a proof procedure for br languages such as constraint logic programming languages. A number of other

21   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

21   Learning Relations by Pathfinding - Richards, Mooney (1992)   (Correct)
First-order learn ing systems (e.g., FOIL, FOCL, FORTE) generally rely on hill-climbing heuristics in order to avoid the combinatorial explosion inheren t in learn ing first-order concepts. However, h... / model building and logic programming. The remainder of this br results in the domain o f logic programming. Section compares

20   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.

20   Residuation and Guarded Rules for Constraint Logic Programming - Smolka (1991)   (Correct)
A major difficulty with logic programming is combinatorial explosion: since goals are solved with possibly indeterminate (i.e., branching) reductions, the resulting search trees may grow wildly. Const... / Guarded Rules for Constraint Logic Programming Residuation and br Guarded Rules for Constraint Logic Programming Gert Smolka June

20   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

20   Cumulative Scheduling with Task Intervals - Caseau, Laburthe (1994)   (Correct)
This paper presents a set of propagation rules to solve cumulative constraints. As in our previous paper on jobshop scheduling [8], our goal is to propose to the CLP community techniques that allow a ... / a strong arguments for using logic programming. We also identify a br . . Relevance to Constraint Logic Programming In addition to the direct

20   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

20   Static Analysis on Communication for Asynchronous Concurrent.. - Kobayashi, Nakade, Yonezawa (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 receiv... / concurrent logic programming languages and br ACL -A Concurrent Linear Logic Programming Paradigm in Logic

20   Design And Implementation Of Rock Roll: A Deductive Object-Oriented.. - Barja, Fernandes, Paton, Williams.. (1995)   (Correct)
This paper presents an approach to the development of a deductive object-oriented database system, describing the key design decisions and their consequences for implementation. The approach is novel,... / Database Programming Logic Programming. . INTRODUCTION The two br conventional OODBs with a logic-programming style of deduction that has

20   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

20   Natural Semantics and Some of its Meta-Theory in Elf - Michaylov, Pfenning (1991)   (Correct)
Operational semantics provide a simple, high-level and elegant means of specifying interpreters for programming languages. In natural semantics, a form of operational semantics, programs are tradition... / and investigate the use of the logic programming language Elf to represent br paper we use Elf a logic programming language based on the LF

20   The Logic of Time Representation - Ladkin (1987)   (Correct)
This investigation concerns representations of time by means of intervals, stemming from work of Allen [All83] and van Benthem [vBen83]. Allen described an Interval Calculus of thirteen binary relatio... / in a high-level system with logic programming and data-types of sequence br Clause form for use in a logic programming system. One of the major

20   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

19   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

19   Two Aspects of Directional Types - Boye, Maluszynski (1995)   (Correct)
The idea of directional types is to describe the computational behaviour of Prolog programs by associating an input and an output assertion to every predicate. The input assertion puts a restriction o... / to recursive procedures and logic programming. Information and br A grammatical view on logic programming The MIT Press .

19   Nondeterministic Lisp as a Substrate for Constraint Logic Programming - Siskind, McAllester (1993)   (Correct)
We have implemented a comprehensive constraintbased programming language as an extension to Common Lisp. This constraint package provides a unified framework for solving both numeric and non-numeric ... / as a Substrate for Constraint Logic Programming Jeffrey Mark Siskind br interest in constraint logic programming languages. Numerous

19   Interval Computation as Deduction in CHIP - Lee, van Emden (1993)   (Correct)
Logic programming realizes the ideal of "computation is deduction," but not when floating-point numbers are involved. In that respect logic programming languages are as careless as conventional comput... / van Emden y Abstract Logic programming realizes the ideal of br are involved. In that respect logic programming languages are as careless

19   Extended Logic Programs as Autoepistemic Theories - Lifschitz (1993)   (Correct)
Recent research on applications of nonmonotonic reasoning to the semantics of logic programs demonstrates that some nonmonotonic formalisms are better suited for such use than others. Circumscription ... / an instrument for the study of logic programming. We prove however in this br The stable model semantics for logic programming. In R. Kowalski and K.

19   Encapsulated Search for Higher-order Concurrent Constraint Programming - Christian Schulte, Gert Smolka (1994)   (Correct)
The paper presents an extension of the concurrent constraint model providing for higher-order programming, deep guards, and encapsulated search. The paper focuses on a higher-order combinator providin... / solving capabilities of logic programming i.e.constraints and br exploits Appears in Logic Programming Proceedings of the

19   A New Definition of SLDNF-resolution - Apt (1992)   (Correct)
We propose a new, "top-down" definition of SLDNF-resolution which retains the spirit of the original definition but avoids the difficulties noted in the literature. We compare it with the "bottom-up" ... / International Conference on Logic Programming pages - . The MIT br logic programs. Journal of Logic Programming - .

19   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

19   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

19   Chare Kernel - A Runtime Support System For Parallel Computations - Shu (1991)   (Correct)
This paper presents the chare kernel system, which supports parallel computations with irregular structure. The chare kernel is a collection of primitive functions that manage chares, manipulate messa... / implementation of concurrent logic programming languages The br The th Int'l Conf.Symp. on Logic Programming pages - August

19   Constraint Inductive Logic Programming - Sebag, Rouveirol (1996)   (Correct)
This paper is concerned with learning from positive and negative examples expressed in first-order logic with numerical constants. The presented approach is based on the cooperation of Inductive Log... / Constraint Inductive Logic Programming Mich ele Sebag br the cooperation of Inductive Logic Programming ILP and Constraint Logic

CiteSeer - citeseer.org - Terms of Service - Privacy Policy - Copyright © 1997-2002 NEC Research Institute