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.
Proof-search in Type-theoretic Languages: An Introduction - Galmiche, Pym (2000)(Correct)
We introduce the main concepts and problems in the theory of proof-search in
type-theoretic languages and survey some specific, connected topics. We do not claim
to cover all of the theoretical and im... / approaches to the semantics of logic programming with type-theoretic br model of computation like logic programming. Representation in
The Framework Approach for Constraint Satisfaction - Roy, Liret, Pachet (2000)(Correct)
Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of constraint satisfaction ... / within the community of logic programming. Constraint logic br logic programming. Constraint logic programming CLP was primarily
A Duality Theory for Bilattices - Mobasher, Pigozzi, Slutzki.. (2000)(Correct)
Recent studies of the algebraic properties of bilattices have provided
insight into their internal structures, and have led to practical results,
especially in reducing the computational complexity of... / and knowledge-based logic programming In particular br procedural semantics of logic programming languages that can deal
Intelligent Access to Heterogeneous Information Sources - Report on.. - Baader, Jeusfeld, Nutt (2000)(Correct)
This paper reports on the 1997 KRDB
workshop [2] that took place in conjunction with
VLDB'97 in Athens, Greece, and whose main topic
was accessing heterogeneous information.
The KRDB workshop series s... / had the goal to establish logic programming on a broader basis for br representation techniques. Logic programming contributes expressive
Workflows, Transactions, and Datalog - Bonner (1999)(Correct)
Transaction Datalog (abbreviated T D) is a concurrent programming language that
provides process modeling, database access, and advanced transactions. This paper
illustrates the use of T D for specify... / systems and concurrent logic programming These formalisms all br subroutine definitions in the logic-programming tradition In particular
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
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
Efficient Implementation of Unification-Based Grammars - Wintner, Francez (1999)(Correct)
Contemporary linguistic formalisms such as LFG or HPSG have become so rigorous that it is now
possible to view them as very high level declarative programming languages. Consequently, grammars
for na... / technique that is common for logic programming languages namely the use of br technique that is common for logic programming languages namely the use
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
Learning Range Restricted Horn Expressions - Khardon (1999)(Correct)
We study the learnability of first order Horn expressions
from equivalence and membership queries. We show that the class of
range restricted Horn expressions, where every term in the consequent
of ... / in framework of Inductive Logic Programming MDR Coh a Coh b It is br Muggleton editor Inductive Logic Programming. Academic Press .
Probabilistic Logic Programming under Maximum Entropy - Lukasiewicz, Kern-Isberner (1999)(Correct)
In this paper, we focus on the combination of probabilistic logic programming
with the principle of maximum entropy. We start by defining probabilistic queries to
probabilistic logic programs and th... / ur Informatik Probabilistic Logic Programming under Maximum Entropy br February Probabilistic Logic Programming under Maximum Entropy
An Integration of Partial Evaluation in a Generic Abstract.. - Puebla, al. (1999)(Correct)
Interpretation Framework
Germ'an Puebla and Manuel Hermenegildo
Department of Computer Science
Technical University of Madrid (UPM)
fgerman,hermeg@fi.upm.es
John P. Gallagher
Department of Comput... / interpretation. Keywords Logic Programming Abstract Interpretation br some classical definitions in logic programming. An atom has the form
Nonmonotonic Inheritance in Object-Oriented Deductive Database.. - May, Kandzia (1999)(Correct)
Deductive object-oriented frameworks integrate logic rules and inheritance.
There, specific problems arise: Due to the combination of deduction and
inheritance, (a) deduction can take place depending ... / reasoning is integrated into logic programming with negation such br logic and classical logic programming augmented with a special
Graph Transformation Units with Interleaving Semantics - Kreowski, Kuske (1999)(Correct)
The aim of the paper is to introduce the notion of a transformation unit together with its interleaving semantics and to study it as a means of constructing large graph transformation systems from sma... / the areas of functional and logic programming formal languages algebraic
Logic Programs for Intelligent Web Search - Thomas (1999)(Correct)
We present a general framework for the information extraction from web pages
based on a special wrapper language, called token-templates. By using tokentemplates
in conjunction with logic programs we... / based wrappers mediators logic programming theory reasoning br fact-retrieval due to logic programming the extracted information
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
A Model-Theoretic Approach for Recovering Consistent Data from.. - Arieli, Avron (1999)(Correct)
One of the most significant drawbacks of classical logic is its being useless in the
presence of an inconsistency. Nevertheless, the classical calculus is a very convenient
framework to work with. In ... / is a common framework for logic programming and nonmonotonic reasoning br introduced bilattice-based logic programming methods Fi Fi b Fi
Graph Transformation Units And Modules - Kreowski, Kuske (1999)(Correct)
The significance of graphs and rules in many areas of computer science is evident: On the one hand, graphs constitute appropriate means for the description of complex relationships between objects. Tr... / the areas of functional and logic programming formal languages algebraic
Relational Learning for NLP using Linear Threshold Elements - Khardon, Roth (1999)(Correct)
We describe a coherent view of learning and
reasoning with relational representations in
the context of natural language processing.
In particular, we discuss the Neuroidal Architecture,
Inductive Log... / Architecture Inductive Logic Programming and the SNoW system br first order logic or Inductive Logic Programming ILP for learning to
An Approach to Animating Model-Based Object-Oriented Formal.. - Czarnecki, Zhang, Lano (1999)(Correct)
One of the important issues in the application
of formal notations in software development is the validation
of formal specifications against the informal customer
requirements. Animation has been pro... / method composition logic programming Z Prolog I. br State for Object-Oriented Logic Programming A Survey Technical
Hidden Coinduction: Behavioral Correctness Proofs for Objects - Goguen, Malcolm (1999)(Correct)
This paper unveils and motivates an ambitious programme of hidden algebraic research
in software engineering, beginning with our general goals, continuing with an overview of
results, and including so... / that an entirely new style of logic programming could develop out of hidden br are important for constraint logic programming. However even these data
Programming by Demonstration: An Inductive Learning Formulation - Lau, Weld (1999)(Correct)
Although Programming by Demonstration (PBD) has
the potential to improve the productivity of unsophisticated
users, previous PBD systems have used brittle,
heuristic, domain-specific approaches to exe... / based on the FOIL inductive logic programming algorithm. We analyze br machine learning inductive logic programming version spaces
Automatic Construction of Semantic Lexicons for Learning Natural.. - Thompson, Mooney (1999)(Correct)
This paper describes a system, Wolfie (WOrd Learning
From Interpreted Examples), that acquires a semantic
lexicon from a corpus of sentences paired with
semantic representations. The lexicon learned c... / Chill uses inductive logic programming Muggleton Lavrac br approach. Journal of Logic Programming - . Haruno M.
Natural Deduction for Intuitionistic Non-Commutative Linear Logic - Polakow, Pfenning (1999)(Correct)
We present a system of natural deduction and associated
term calculus for intuitionistic non-commutative linear logic (INCLL) as
a conservative extension of intuitionistic linear logic. We prove sub... / of a logical framework and logic programming language along the lines of br search mechanism suitable for logic programming and applied it to
Higher-order Matching for Program Transformation - de Moor, Sittampalam (1999)(Correct)
We present a simple, practical algorithm for higher-order matching in the context
of automatic program transformation. Our algorithm finds more matches than the
standard second-order matching algorith... / of a naive interpreter for a logic programming language. In particular the br similar to the search trees of logic programming. As in the case of logic
Return Value Placement And Tail Call Optimization In High Level.. - Bigot, Debray (1999)(Correct)
Machine [21], is to pass the ith argument in
register i: if the ith argument happens to be a variable (which typically corresponds
to an output argument), the value passed is a pointer to the location... / J. Logic Programming - Return br values in functional and logic programming languages. Implementations
Loglinear models for first-order probabilistic reasoning - Cussens (1999)(Correct)
Recent work on loglinear models in probabilistic
constraint logic programming is applied
to first-order probabilistic reasoning.
Probabilities are defined directly on the
proofs of atomic formulae, a... / in probabilistic constraint logic programming is applied to first-order br in this framework Inductive Logic Programming ILP can be used to induce
The Relative Complement Problem for Higher-Order Patterns - Momigliano, Pfenning (1999)(Correct)
We address the problem of complementing higher-order patterns without repetitions
of free variables. Differently from the first-order case, the complement of a pattern
cannot, in general, be described... / In most functional and logic programming languages the notion of a br have found applications in logic programming logical frameworks
INTERDIP - An Interactive Constraint Based Nurse Scheduler - Abdennadher, Schlenker (1999)(Correct)
In every hospital a duty roster for the nursing staff of each ward
must be created each month. The roster has to take into account several
requirements such as minimal allocation of a station, legal r... / of Constraint Technologies and Logic Programming PACLP London br IH Recently Constraint Logic Programming Van JM FA MS
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
Declarative Internet Programming Constraint-based Optimization of.. - Hickey (1999)(Correct)
no abstract-- unknown Declarative Internet Programming
Constraint-based Optimization of Scheme Applets
Timothy J. Hickey
,
February 16, 1999
1 Proposed research
This proposal addresses both theor... / LISP and Scheme systems and Logic Programming systems available on the br in our work on constraint logic programming languages and
Extensions of Constraint Solving for Proof Planning - Melis, Müller, Zimmer (1999)(Correct)
The integration of constraint solvers into proof planning has pushed the problem solving
horizon. Proof planning benefits from the general functionalities of a constraint solver such
as consistency ch... / and constraint logic programming and to integrate br is a notion in constraint logic programming that corresponds to the
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
Preferred Arguments are Harder to Compute than Stable Extensions - Dimopoulos, Nebel, Toni (1999)(Correct)
Based on an abstract framework for nonmonotonic
reasoning, Bondarenko et al. have extended
the logic programming semantics of admissible
and preferred arguments to other nonmonotonic
formalisms such ... / et al. have extended the logic programming semantics of admissible br semantics in propositional logic programming and propositional default
Projections of programs revisited - Lämmel, Riedewald, Lohmann (1999)(Correct)
There are different concepts facilitating correct program transformations,
e.g. fold/unfold strategies or projections. In this paper a characterization
of a broad class of projections is presented. A ... / of ways to extend programs. In logic programming a prominent example for br for a survey in the context of logic programming and refer to RF for a
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
Transformations between Signed and Classical Clause Logic - Bernhard Beckert, Reiner Hähnle.. (1999)(Correct)
In the last years two automated reasoning techniques for
clause normal form arose in which the use of labels are prominently
featured: signed logic and annotated logic programming, which can be
embe... / signed logic and annotated logic programming which can be embedded into br while annotated logic programming see for example
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
SYNTH User's Manual - Alpuente, Ferri, Vidal, Moreno, al. (1999)(Correct)
This report describes Synth, a semiautomatic
program transformator for lazy (call-by-name) functional logic
programs based on needed narrowing. The correctness of the transformation
system is proved i... / of lazy functional and logic programming. This report describes br on Visions for the Future of Logic Programming pages - .
Herbrand Constraint Solving in HAL - Demoen, al. (1999)(Correct)
CHAT offers an alternative to SLG-WAM for implementing the suspension and resumption of consumers:
unlike SLG-WAM, it does not use freeze registers nor a complicated trail to preserve their
execution ... / of trail that tabled logic programming systems require. br as an important feature of logic programming systems. Indeed a number
CH-Prolog: A Proof Procedure for Positive Disjunctive Logic.. - Wenjin Lu (1999)(Correct)
The success of Prolog motivates people to use full firstorder
logic instead of only Horn clauses as the basis
of logic programming. One of the main work in this
extending is to seek proof procedure fo... / for Positive Disjunctive Logic Programming Wenjin Lu Department br Horn clauses as the basis of logic programming. One of the main work in
Analogical Prediction - Muggleton, Bain (1999)(Correct)
Inductive Logic Programming (ILP) involves constructing an hypothesis H on the basis of background
knowledge B and training examples E. An independent test set is used to evaluate the accuracy of H.
... / Abstract Inductive Logic Programming ILP involves constructing br and L. De Raedt. Inductive logic programming Theory and methods.
1BC: a First-Order Bayesian Classifier - Flach (1999)(Correct)
In this paper we present 1BC, a first-order
Bayesian Classifier. While the propositional
Bayesian Classifier makes the naive Bayes assumption
of statistical independence of atomic
features (one attrib... / datasets from Inductive Logic Programming ILP Naive Bayesian br as is common in inductive logic programming the obvious choice seems
Typed Higher-order Narrowing without Higher-order Strategies - Sergio Antoy (1999)(Correct)
We describe a new approach to higher-order narrowing computations in a class of systems suitable
for functional logic programming. Our approach is based on a translation of these systems
into ordinary... / suitable for functional logic programming. Our approach is based on a br compiler output. In functional logic programming typing the target language
BinProlog 7.0 Professional Edition - Internet Programming Guide - Tarau (1999)(Correct)
This document covers, through examples, a number
of typical Internet programming patterns.
2 Installing the BinNet Internet Toolkit unknown BinProlog 7.0 Professional Edition
Internet Programming Guid... / years towards a sophisticated Logic Programming based Internet application br CA . P. Tarau. Logic Programming and Virtual Worlds. In
ONTOFILE: Exterior and Interior Ontologies of File/HTTP URLs - Harold Boley (1999)(Correct)
The conceptual-modeling language ONTOFILE is introduced to cope with the ontological
complexity of (distributed) le systems. On the basis of the functional-logic
language Relfun and the metadata-elem... / Workshop on Functional and Logic Programming Bad Honnef April . The br Workshop on Extensions of Logic Programming ELP ' St. Andrews
Interfacing Prolog and VRML and its Application to Constraint.. - Smedbäck, Carro, Hermenegildo (1999)(Correct)
A number of data description languages initially designed as standards for the WWW are currently
being used to implement user interfaces to programs. This is done independently of
whether such program... / visualization Constraint Logic Programming Constraint Programming br International Symposium on Logic Programming pages - Silver
An Operational Model for Parsing Definite Clause Grammars with.. - Vilares, Alonso, Cabrero (1999)(Correct)
Logic programs share with context-free grammars a strong
reliance on well-formedness conditions. Their proof procedures can be
viewed as a generalization of context-free parsing. In particular, defi... / works based on constraint logic programming Since linguistic and br on LR parsing. International Logic Programming Symposium - .
Theory Recovery - Rupert Parson (1999)(Correct)
In this paper we examine the problem of repairing incomplete
background knowledge using Theory Recovery. Repeat Learning under
ILP considers the problem of updating background knowledge in order to
... / progresses. Under Inductive Logic Programming ILP the learner's br Conference on Inductive Logic Programming volume of LNAI
Implementing Prioritized Logic Programming - Wu, Zhang (1999)(Correct)
Conflict resolution is an important issue in knowledge representation
and reasoning. A common idea of solving conflicts in reasoning
is to introduce priorities in the underlying reasoning mechanism.... / Implementing Prioritized Logic Programming Cheng-Min Wu and Yan Zhang br is supported in part by a Logic Programming Research Scholarship from
Tile Logic for Synchronized Rewriting of Concurrent Systems - Bruni (1999)(Correct)
Tile logic is a framework to reason about the dynamic evolution of concurrent
systems in a modular way. It extends rewriting logic (in the unconditional case)
by adding rewriting synchronization and s... / for reduction in calculus logic programming and calculi with mobility
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
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
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
Logics for Databases and Information Systems - Chomicki, (Eds.) (1998)(Correct)
Temporal Databases 34
3.2.2 Relational Database Histories 36
3.3 Temporal Queries 36
3.3.1 Abstract Temporal Query Languages 37
3.3.2 Expressive Power 41
3.3.3 Space-efficient Encoding of Temporal Dat... / Temporal Structures . Logic Programming . . Herbrand Models br logic program logic programming logical consequence
Formalization of the Development Process - Basin, Krieg-Brückner (1998)(Correct)
Introduction
14.1.1 What is development?
Software development encompasses many phases including requirements engineering,
specification, design, implementation, verification or testing, and
maintena... / synthesis. Journal of Logic Programming . Fea Martin br provers in a higher-order logic programming language. In th Intl.
Colimit Library for Graph Transformations and Algebraic Development.. - Dietmar Wolz (1998)(Correct)
ions are defined both for objects and layers. There are several compatibility
requirements for the definition of these functions. The set of objects contains a specific
?-element which allows the sou... / semantics of functional logic programming languages CW based on br semantics of functional logic programming languages CW to
Using Multi-Strategy Learning to Improve Planning Efficiency and.. - Estlin (1998)(Correct)
viii
Chapter 1 Introduction 1
1.1 Acquiring Planning Control Knowledge . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Scope: A Control Knowledge Acquisition System . . . . . . . . . . . . . ... / with techniques from inductive logic programming. Specifically EBL is used br . . . Inductive Logic Programming .
Logic-Based Abductive Inference - Sheila A. McIlraith (1998)(Correct)
This paper surveys the work on abductive inference within the field of artificial
intelligence (AI), with particular attention to logic-based abduction. The paper
commences with a formal description o... / . . Logic Programming Framework . br a causal framework a logic programming framework and the Theorist
The State of Change: A Survey - Bonner, Kifer (1998)(Correct)
Updates are a crucial component of any database programming
language. Even the simplest database transactions, such as withdrawal
from a bank account, require updates. Unfortunately, updates are
not... / short-term practical solution logic programming languages have resorted to br those designed for database or logic programming and those designed for
Overview of Datalog Extensions with Tuples and Sets - Liu (1998)(Correct)
Datalog (with negation) is the most powerful query language for relational database
with a well-defined declarative semantics based on the work in logic programming. However,
Datalog only allows inexp... / on Deductiveuctive and Logic Programming DDLP ' Manchester UK br semantics based on the work in logic programming. However Datalog only
Creating Specialised Integrity Checks Through Partial Evaluation of.. - Leuschel, De Schreye (1998)(Correct)
Integrity constraints are useful for the specification of deductive databases, as well
as for inductive and abductive logic programs. Verifying integrity constraints upon
updates is a major efficiency... / as a meta-interpreter in logic programming. This meta-interpreter br the references therein and logic programming e.g.
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
Expressive Power of Declarative Programming Languages - Matsushita (1998)(Correct)
The thesis investigates several aspects of the expressive power of declarative programming
languages.
There seems to be no widely accepted definition of expressive power of programming
languages. In t... / counterparts of some logic programming techniques . br Workshop on Functional and Logic Programming A part of Chapter
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.
Semantics Of (disjunctive) Logic Programs Based On Partial Evaluation - Brass, Dix (1998)(Correct)
SEMANTICS AND TRANSFORMATIONS
In this paper, we consider allowed disjunctive DATALOG
:
programs over some
fixed function-free finite signature \Sigma. In fact, in the semantical part of this paper,... / J. Logic Programming - Semantics br understanding and computing logic programming semantics. We consider
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
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
Interleaving Natural Language Parsing and Generation Through Uniform.. - Neumann (1998)(Correct)
We present a new model of natural language processing in which natural language
parsing and generation are strongly interleaved tasks. Interleaving of parsing
and generation is important if we assume ... / and introduce constraint logic programming CLP as an appropriate br are used. . Constraint-logic programming Since the last decade a
Specifying Real-Time Finite-State Systems in Linear Logic - Kanovich, Okada, Scedrov (1998)(Correct)
Real-time finite-state systems may be specified in linear logic by means of linear implications
between conjunctions of fixed finite length. In this setting, where time is treated as a
dense linear or... / proof search in concurrent logic programming environments based on br in the available concurrent logic programming environments based on
"Classical" Negation in Non-Monotonic Reasoning and Logic Programming - Alferes, Pereira, al. (1998)(Correct)
this paper appeared in the Proceedings of the European Workshop on Logic in
Artificial Intelligence (JELIA'96), Lecture Notes on Artificial Intelligence, Springer Verlag, 1996, vol. 1126,
pp. 143-163. / Non-Monotonic Reasoning and Logic Programming Jos'e Alferes y br the somewhat vague spirit of logic programming and deductive databases
Expanding Queries to Incomplete Databases By Interpolating General.. - Baral, Gelfond, Kosheleva (1998)(Correct)
In databases, queries are usually defined on complete databases. In this paper we introduce and
motivate the notion of extended queries that are defined on incomplete databases. We argue that
the lang... / abductions in extensions of logic programming For a survey on this see br there has not been any logic programming representation of this
Conservative Extension in Positive/Negative Conditional Term.. - Fokkink, Verhoef (1998)(Correct)
We transpose a conservative extension theorem from structural
operational semantics to conditional term rewriting. The result is
useful for the development of software renovation factories, and for ... / stable models from logic programming. Van de Pol used br well-established notions from logic programming See for a
Probabilistic and Truth-Functional Many-Valued Logic Programming - Thomas Lukasiewicz (1998)(Correct)
We introduce probabilistic many-valued logic programs in which the implication
connective is interpreted as material implication. We show that probabilistic many-valued logic
programming is computat... / Truth-Functional Many-Valued Logic Programming Thomas Lukasiewicz IFIG br Truth-Functional Many-Valued Logic Programming Thomas Lukasiewicz
Possible New Directions in Mathematical Foundations of Fuzzy.. - Nguyen, Kreinovich (1998)(Correct)
this paper, we describe
new possible application-oriented directions towards
formalizing these new ideas: unknown Possible New Directions in
Mathematical Foundations of Fuzzy Technology:
A Contributio... / AI methods such as logic programming. In this paper we mention br AI methods such as logic programming. The corresponding results
The logic of learning: a brief introduction to Inductive Logic.. - Flach (1998)(Correct)
This paper is intended to provide an introduction to ILP. We will both review some of the established approaches to Horn clause induction (Section 2), and recent work on induction of integrity constra... / introduction to Inductive Logic Programming Peter A. Flach br Introduction Inductive logic programming has its roots in concept
Semantic-Based Program Analysis for Logic-Based Languages using XSB - Codish, Demoen (1998)(Correct)
This article describes a simple and efficient way of using a logic programming language with
tabulation for general purpose semantic-based program analysis. The simplicity of the method
is based on a ... / and efficient way of using a logic programming language with tabulation br XSB is a general purpose logic programming system which supports
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
Non-Disjoint Unions of Theories and Combinations of Satisfiability.. - Tinelli, Ringeissen (1998)(Correct)
In this paper we outline a theoretical framework for the combination of decision procedures for the satisfiability of constraints with respect to a constraint theory. We describe a general combination... / Logic Com Constraint Logic Programming JM HS Deduction br successful-especially in Logic Programming-it has been limited so
First-Order Representation Of Stable Models - Eiter, Lu, Subrahmanian (1998)(Correct)
Turi (1991) introduced the important notion of a constrained atom: an atom with associated
equality and disequality constraints on its arguments. A set of constrained atoms is a constrained
interpre... / International Conference on Logic Programming and Nonmonotonic Reasoning br RR Introduction Logic programming is commonly known as an
Many-Valued First-Order Logics with Probabilistic Semantics - Thomas Lukasiewicz (1998)(Correct)
We present n-valued first-order logics with a purely probabilistic
semantics. We then introduce a new probabilistic semantics of
n-valued first-order logics that lies between the purely probabilist... / ffl We show that disjunctive logic programming with n-valued disjunctive br to classical disjunctive logic programming in n Gamma layers.
Linear concurrent constraint programming: operational and phase.. - Fages, Ruet, Soliman (1998)(Correct)
In this paper we settle a logical semantics for the class CC of concurrent
constraint programming languages and for its extension LCC based on
linear constraint systems. Besides the characterization i... / class CLP X of constraint logic programming languages introduced by br and Lassez extends logic programming by combining the pure Horn
Parallel Logic Programming Techniques - van Lohuizen (1998)(Correct)
Model [War87a] x x
16 Delphi [CA88] x x
17 Randomize Method [JAM88] x x
18 ORBIT [YN84] ? ? ?
19 VMHW model [VXDRS91] ? ? ?
20 VMBA model [VXDRS91] ? ? ?
Table 2.1: Time complexity of operations in OR... / Language Interfaces Parallel Logic Programming Techniques Delft br Report Series Parallel Logic Programming Techniques M. P. van
The Diagnosis Frontend of the dlv System - Eiter, Faber, Leone, Pfeifer (1998)(Correct)
This paper presents the Diagnosis Front-End of dlv, which is a knowledge
representation system under development at the Technische Universitat Wien.
The kernel language of the system is an extension ... / is an extension of disjunctive logic programming DLP by integrity br Keywords Disjunctive Logic Programming Diagnosis Abduction
On the Decidability and Axiomatization of Query Finiteness in.. - Kifer (1998)(Correct)
A database query is finite
1
if its result consists of a finite set of tuples. For queries formulated
as sets of pure Horn rules, the problem of determining finiteness is, in general, undecidable.
I... / and Theorem Proving -logic programming. General Terms br review the standard notions of logic programming and deductive databases.
Executing Suspended Logic Programs - Kowalski, Toni, Wetzel (1998)(Correct)
We present an extension of Logic Programming (LP) which, in addition to ordinary
LP clauses, also includes integrity constraints, explicit representation of disjunction in
the bodies of clauses and ... / We present an extension of Logic Programming LP which in addition to br aims to unify Constraint Logic Programming CLP Abductive Logic
A Semantics for Modular General Logic Programs - Etalle (1998)(Correct)
Modular programs are built as a combination of separate modules, which
may be developed and verified separately. Therefore, in order to reason over
such programs, compositionality plays a crucial role... / modules. In the field of logic programming the need for a br Logic Programs. Keywords Logic programming modularity open programs
DOGMA: A GA-Based Relational Learner - Hekanaho (1998)(Correct)
We describe a GA-based concept learning/theory revision system DOGMA
and discuss how it can be applied to relational learning. The search for better
theories in DOGMA is guided by a novel fitness func... / ILP. In Proc. of Inductive Logic Programming th International br imperfect data in inductive logic programming. In Proc. of the th
A Survey of Intelligent Debugging - Stumptner, Wotawa (1998)(Correct)
this paper is to examine
recent and current debugging approaches that
promise to have the potential of going a step further
along the road towards automatic program debugging.
Traditionally, automated... / originally specified in a Logic Programming context which was refined br languages also known in the logic programming literature as Declarative
A Deduction Method Complete for Refutation and Finite Satisfiability - Bry, Torge (1998)(Correct)
Database and Artificial Intelligence applications are briefly
discussed and it is argued that they need deduction methods that are
not only refutation complete but also complete for finite satisfiab... / Intelligence Databases and Logic Programming where this representation br Int. Conf. on Algebraic and Logic Programming Springer LNCS .
Constraint Logic Programming over Unions of Constraint Theories - Tinelli, Harandi (1998)(Correct)
In this paper, we present an extension of the Jaffar-Lassez Constraint
Logic Programming scheme that operates with unions of constraint
theories with different signatures and decides the satisfiabilit... / Constraint Logic Programming over Unions of Constraint br the Jaffar-Lassez Constraint Logic Programming scheme that operates with
WHIRL: A Word-based Information Representation Language - Cohen (1998)(Correct)
We describe WHIRL, an "information representation language" that synergistically combines properties of logic-based and text-based representation systems. WHIRL is a subset of non-recursive Datalog th... / Notationally we will use logic-programming syntax and terminology
Anaphoric Linking at Run Time: A Type-Logical Account of Discourse.. - Terui (1998)(Correct)
A number of attempts have been made to combine Discourse Representation Theory with
type-logical grammar in order to obtain a compositional (bottom-up) framework for discourse
representation (e.g., Mu... / a logical basis to certain logic programming languages constraint br S. Hodas and Dale Miller. Logic programming in a fragment of
Concurrent Constraint Programming and Non-Commutative Logic - Ruet, Fages (1998)(Correct)
This paper presents a connection between the intuitionistic
fragment of a non-commutative version of linear logic introduced by
the first author (NLI) and concurrent constraint programming (CC).
We ... / combination of constraint logic programming and concurrent logic br and concurrent logic programming with a synchronization
A Clausal Logic for Deontic Action Specification (Extended Abstract) - van der Meyden (1998)(Correct)
Ron van der Meyden
Department of Computer Science,
Rutgers University
August 17, 1998
Abstract
This paper investigates the theoretical foundations of a clausal action specification
language desig... / appears in Proc. International Logic Programming Symposium MIT Press . br of the paper is to advocate a logic programming approach to modal logics of
Top-down induction of clustering trees - Blockeel, De Raedt, Ramong (1998)(Correct)
An approach to clustering is presented that
adapts the basic top-down induction of decision
trees method towards clustering. To
this aim, it employs the principles of instance
based learning. The resu... / of the inductive logic programming system Tilde. Various br setting for inductive logic programming. For the purposes of this
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
An Emptiness Algorithm for Regular Types with Set Operators - Lu, Cleary (1998)(Correct)
An algorithm to decide the emptiness of a regular type expression
with set operators given a set of parameterised type definitions
is presented. The algorithm can also be used to decide the equivale... / have been introduced into logic programming in the forms of type br Recent logic programming systems allow the
Deriving analysers by folding/unfolding of natural semantics and a.. - Gouranton (1998)(Correct)
We consider specifications of analysers expressed as compositions
of two functions: a semantic function, which returns a natural
semantics derivation tree, and a property defined by recurrence on de... / slicing analysis for a logic programming language. Introduction br of a slicing analysis for a logic programming language. The different
Type Analysis for CHIP - Drabent, Pietrzak (1998)(Correct)
This paper proposes a tool to support reasoning about (partial)
correctness of constraint logic programs. The tool infers a specification
that approximates the semantics of a given program. The sema... / the context of CLP constraint logic programming Speaking informally a br For the case of LP logic programming it was shown Boy that
Inferring call and success types for CLP programs - Drabent, Pietrzak (1998)(Correct)
This paper proposes a tool to support reasoning about (partial)
correctness of constraint logic programs. The tool infers a specification
that approximates the semantics of a given program. The main
i... / basic notions of constraint logic programming we introduce the br other program P CS In logic programming this approach is often
Optimization of Mercury programs - Taylor (1998)(Correct)
The pure logic programming language Mercury is very well suited to the development of
sophisticated program transformations due to its clean semantics and strong type, mode and
determinism systems. We... / Abstract The pure logic programming language Mercury is very br an implementation of a logic programming language suitable for real
The Well-founded Semantics Is the Principle of Inductive Definition - Denecker (1998)(Correct)
Existing formalisations of (transfinite) inductive definitions
in constructive mathematics are reviewed and strong correspondences
with LP under least model and perfect model semantics become appare... / Inductive Definitions Logic Programming. Introduction With br in Nonmonotonic Reasoning logic programming is currently often seen as a
Logical Semantics and Language for Databases with Partial and.. - Liu (1998)(Correct)
Mengchi Liu
Department of Computer Science
University of Regina, Regina, Saskatchewan, Canada S4S 0A2
Email: mliu@cs.uregina.ca
Abstract
We discuss the semantics of complex object databases with ... / on Deductiveuctive and Logic Programming DDLP ' Manchester UK br of Deductive Databases and Logic Programming pages - . Morgan
Semantic Query Optimization through Abduction and Constraint Handling - Wetzel, Toni (1998)(Correct)
The use of integrity constraints to perform Semantic Query
Optimization (SQO) in deductive databases can be formalized in a way
similar to the use of integrity constraints in Abductive Logic Program... / constraints in Abductive Logic Programming ALP and the use of br Handling Rules in Constraint Logic Programming CLP Based on this
Efficient Goal Directed Bottom-up Evaluation of Logic Programs - Codish (1998)(Correct)
This paper introduces a new strategy for the efficient goal directed bottomup
evaluation of logic programs. Instead of combining a standard bottomup
evaluation strategy with a Magic-set transformation... / K. R. Apt. Introduction to logic programming. In J. van Leeuwen editor br of magic. The Journal of Logic Programming and - .
Context-Sensitive Computations in Functional and Functional Logic.. - Lucas (1998)(Correct)
F3.68e+05>
Context-sensitive rewriting is a refined form of rewriting that explores
a smaller reduction space by imposing some fixed restrictions on
the replacements. Any Term Rewriting ... / The Journal of Functional and Logic Programming The MIT Press Volume br The Journal of Functional and Logic Programming is a peer-reviewed and
Symbolic Schedulability Analysis of Real-time Systems - Hee-Hwan Kwak (1998)(Correct)
We propose a unifying method for analysis of scheduling
problems in real-time systems. The method is based on
ACSR-VP, a real-time process algebra with value-passing
capabilities. We use ACSR-VP to de... / programming or constraint logic programming. The paper presents br Constraint Logic Programming Theorem Prover Figure .
Structural Polymorphism - Ruehr (1998)(Correct)
This paper describes structural polymorphism, a new form of type polymorphism appropriate to functional languages
featuring user-defined algebraic data types (e.g., Standard ML, Haskell and Miranda
1
... / working in higher-order logic programming have proposed notions of
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.
Defining and Translating Visual Schemas for Deductive Databases - Puigsegur, Pastor, Agusti (1998)(Correct)
We present a visual language expressive enough to capture an important subset of First
Order Predicate Logic as well as its straightforward translation to the logic-based paradigm of
deductive databas... / areas of logic databases logic programming and artificial intelligence br with other areas such as logic programming an important problem the
Running Programs Backwards: The Logical Inversion of Imperative.. - Ross (1998)(Correct)
The feasibility of inverting imperative computations using logic programming technology
is informally explored. Program inversion is the process of determining the possible input
values that will prod... / imperative computations using logic programming technology is informally br practical applications when logic programming technology is considered. An
Dominance Constraints in Context Unification - Niehren, Koller (1998)(Correct)
Tree descriptions based on dominance constraints are popular
in several areas of computational linguistics including syntax, semantics,
and discourse. Tree descriptions in the language of context un... / to model data structures in logic programming to reason with br Arti cial Intelligence and Logic Programming. Oxford University Press
Program Specialization via Algorithmic Unfold/Fold Transformations - Pettorossi, Proietti (1998)(Correct)
this paper we will essentially
refer to these techniques as they have been developed in the fields of functional
and logic programming. unknown Program Specialization via Algorithmic Unfold/Fold
Trans... / the fields of functional and logic programming. Partial Evaluation and br in the case of functional and logic programming the basic program
Integrating Reactive and Reflective Reasoning by Generating Rational.. - Bornscheuer (1998)(Correct)
We propose to model integrated reflective and reactive reasoning
by massively parallel nonmonotonic model generation. To this
end, a finite representation of models of normal logic programs is given... / work from theorem proving and logic programming and is of own interest in br Handbook of Logic in AI and Logic Programming Vol. . Oxford Science
Experiments In Reactive Constraint Logic Programming - Fages, Fowler, Sola (1998)(Correct)
this paper we study a reactive extension of constraint logic programming.
Our primary concerns are search problems in a dynamic environment,
where interactions with the user (e.g. in interactive multi... / In Reactive Constraint Logic Programming Francois Fages Julian br extension of constraint logic programming. Our primary concerns are
Verification and Validation Issues in Expert and Database Systems.. - Coenen (1998)(Correct)
This paper is directed at two central objectives. The first
is to identify and establish areas of overlap between the expert
and database system domains. The second is to present
a view of existing an... / the link between Constraint logic Programming and constraint databases. br properties to that of a logic programming environment. For example
Quasi-Stable Semantics of Logic Programs - Wang, Mott (1998)(Correct)
this paper, we introduce a new
semantic theory for logic programs.
We choose the Well-Founded Semantics (WFS) [23] as our starting point
because it has many desirable features. For any logic program t... / The semantics of logic programming and deductive databases has br these semantic theories for logic programming is also studied in Here
A Proof Theoretic View of Constraint Programming - Apt (1998)(Correct)
We provide here a proof theoretic account of constraint programming that attempts
to capture the essential ingredients of this programming style. We exemplify it by
presenting proof rules for linear... / instance of it is constraint logic programming exemplified by such br and elegance of constraint logic programming has already led to a general
Logic Based Modeling and Analysis of Workflows (Extended Abstract) - Davulcu, al. (1998)(Correct)
Hasan Davulcu Michael Kifer C.R. Ramakrishnan I.V. Ramakrishnan
Department of Computer Science
SUNY at Stony Brook, Stony Brook, NY 11794-4400
fdavulcu,kifer,cram,ramg@cs.sunysb.edu
To appear in PO... / properties. Finally like in logic programming systems the proof theory of br and M. Kifer. Transaction logic programming or a logic of declarative
On Computational Representations of Herbrand Models - Matzinger (1998)(Correct)
Computationally feasible representations of models of first-order formulas
are of interest in various fields like e.g. in automated model building, automated deduction,
deductive databases, etc. For... / checking deductive databases logic programming etc. That's why we br editor Proceedings Logic Programming and Automated Reasoning St.
Towards Soft Typing for CLP - Deransart, Maluszynski (1998)(Correct)
The paper links the goals to be achieved by a type system to the problem
of partial correctness of CLP programs. Several concepts of type correctness
of programs are identified by referring to variou... / industrially used Constraint Logic Programming CLP languages like CHIP br typed logic used for logic programming in e.g. The type
Reactive Functional Programming - Kieburtz (1998)(Correct)
Reactive systems respond to concurrent, possibly unsynchronized streams of input
events. Programming reactive systems is challenging without language support for
event-triggered actions. It is even mo... / should like to have a sound programming logic that is expressive over the br systems and an associated programming logic. The control structure
Progress Report on the Disjunctive Deductive Database System - Eiter (1998)(Correct)
dlv is a deductive database system, based on disjunctive logic programming,
which offers front-ends to several advanced KR formalisms. The system
has been developed since the end of 1996 at Technisc... / system based on disjunctive logic programming which offers front-ends to br implementation of disjunctive logic programming. A major strength of dlv are
Strategic Reflection - Lincoln, Meseguer (1998)(Correct)
The Maude system incorporates reflective capabilities that
enable quite sophisticated strategies to be expressed very conveniently.
Maude's strategy languages have been used to control the execution... / a conservative way Horn logic programming could also be supported and br Vittek. Designing constraint logic programming languages using
Unfold/Fold Transformations of CCP programs - Sandro Etalle (1998)(Correct)
We introduce a transformation system for concurrent constraint
programming (CCP). We define suitable applicability conditions for the transformations
which guarantee that the input/output ccp semant... / which in the field of logic programming is mostly referred to as br in and then adapted to logic programming LP both for program
Polymorphism in Hindley/Milner Style Type Systems with Constraints - Sulzmann (1998)(Correct)
In this paper we consider Hindley/Milner style type systems
that deal with some form of constraints. We study the interplay between
polymorphism and constraints in such systems. Previous approaches ... / framework in constraint logic programming JM The HM X framework br and Michael Maher. Constraint logic programming A survey. Journal of
A Logical Foundation for Logic Programming II: Semantics of General.. - Bochman (1998)(Correct)
We suggested in [12] a general logical formalism for Logic Programming
based on a four-valued inference. In this paper we give a uniform
representation of various semantics for logic programs based on... / A Logical Foundation for Logic Programming II Semantics of General br general logical formalism for Logic Programming based on a four-valued
A Framework for Assertion-based Debugging in Constraint Logic.. - Germ'an Puebla (1998)(Correct)
We propose a general framework for assertion-based debugging of constraint
logic programs. Assertions are linguistic constructions which allow expressing
properties of programs. We define assertion ... / Debugging in Constraint Logic Programming Germ'an Puebla br As constraint logic programming CLP systems mature
Semantic Lexicon Acquisition for Learning Natural Language Interfaces - Thompson, Mooney (1998)(Correct)
This paper describes a system, Wolfie (WOrd Learning
From Interpreted Examples), that acquires a semantic
lexicon from a corpus of sentences paired with representations
of their meaning. The lexicon l... / Chill uses inductive logic programming Muggleton Lavrac br S. Dzeroski. . Inductive Logic Programming Techniques and
Three companions for first order data mining - De Raedt, Blockeel, Dehaspe, Van Laer (1998)(Correct)
Three companion systems, Claudien, ICL and Tilde, are
presented. They use a common representation for examples and hypotheses:
each example is represented by a relational database. This contrasts
wi... / with the classical inductive logic programming systems such as Progol br with the classical inductive logic programming setting employed by systems
How to Execute ULTRA Transactions (Extended Abstract) - Wichert, Fent, Freitag (1998)(Correct)
Carl-Alexander Wichert, Alfred Fent, Burkhard Freitag
Universitat Passau, Fakultat fur Mathematik und Informatik
D-94030 Passau, Germany
e-mail: fwichert,fent,freitagg@fmi.uni-passau.de
Tel: +49 (... / in analogy to conventional logic programming languages. Basic updates br Joint Int. Conf. and Symp. on Logic Programming JICSLP ' Bonn
A Matrix Characterization for MELL - Mantel, Kreitz (1998)(Correct)
We present a matrix characterization of logical validity in the
multiplicative fragment of linear logic with exponentials. In the process
we elaborate a methodology for proving matrix characterizati... / has found applications in logic programming modeling concurrent br Some applications for linear logic programming are illustrated in
HOT: A Concurrent Automated Theorem Prover based on Higher-Order.. - Konrad (1998)(Correct)
Hot is an automated higher-order theorem prover based on HT E, an extensional
higher-order tableaux calculus. The first part of this paper introduces an improved variant of the
calculus which closel... / implemented in a concurrent logic programming language see section br programming constraint logic programming and concurrent objects with
Constructive Theory Refinement in Knowledge Based Neural Networks - Rajesh Parekh (1998)(Correct)
Knowledge based artificial neural networks offer
an approach for connectionist theory refinement. We
present an algorithm for refining and extending the domain
theory incorporated in a knowledge based... / inductive logic programming and connectionist br S. Muggleton Inductive Logic Programming Academic Press San Diego
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
Cut-elimination and a permutation-free sequent calculus for.. - Dyckhoff, Pinto (1998)(Correct)
We describe a sequent calculus, based on work of Herbelin, of which the cut-free
derivations are in 1-1 correspondence with the normal natural deduction proofs of
intuitionistic logic. We present a ... / formula used in logic programming Herbelin's calculus is br adopted a notation used in logic programming for judgments with a
Reducing query answering to satisfiability in nonmonotonic logics - Rosati (1998)(Correct)
We propose a unifying view of negation as failure, integrity
constraints, and epistemic queries in nonmonotonic reasoning.
Specifically, we study the relationship between satisfiability
and logical im... / in nonmonotonic reasoning and logic programming. From the perspective of br in nonmonotonic reasoning and logic programming. In particular we prove
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
Extending A General-Purpose Algebraic Modeling Language To.. - Robert Fourer (1998)(Correct)
this paper is to suggest, by analysis and by example, how we are now in a
much improved position to overcome this deadlock.
The first part of this paper (sections 1--3) explores combinatorial extensio... / Combinatorial Optimization A Logic Programming Approach Robert Fourer br are commonly referred to as logic programming or as constraint logic
On the Combination of Partial Action Descriptions - Bornscheuer, Lehmann (1998)(Correct)
We investigate the problems of precondition interactions and
effect cumulations, typically caused by the concurrent execution of actions.
Our analysis leads to an integration of property oriented an... / multisets within equational logic programming. Similar to A the br and Hypotheses. Journal of Logic Programming - - May .
Logic Program Schemas, Constraints and Semi-Unification - Chasseur, Deville (1998)(Correct)
Program schemas are known to be useful in different applications
such as program synthesis, transformation, analysis, debugging,
teaching : : : This paper tackles two complementary aspects of progra... / Introduction In logic programming the use of program schemas br are different. Prolog is a logic programming language in the same way
Adaptive Solving of Equations over Rational Trees - Wolf (1998)(Correct)
Two variants of an incremental and adaptive unification algorithm
are presented. Both variants decide incrementally the consistency
of conjunctions of syntactical equations over rational trees after... / The application of Constraint Logic Programming CLP to solve Dynamic br S.A. Tarnlund editors Logic Programming pages - . Academic
LPI encodings of choices, exceptions and first-class events - Caires, Monteiro (1998)(Correct)
In this paper we present a revised and simplified formulation of
the Lpi language, and give some evidence for its expressiveness in the
context of communication and concurrency abstractions.
1 Introdu... / of specification typical of logic programming. Lpi was motivated both br similar to what happens in logic programming languages. In this case the
Large Combinatorial Optimization Problems: a Methodology for Hybrid.. - Carmen Gervet (1998)(Correct)
Large Scale Combinatorial Optimization problems (LSCO) appear in
numerous types of industrial applications (e.g. production scheduling, routing problems,
financial applications). They are NP-complet... / techniques within the logic programming paradigm cf. the CHIP br Benhamou. Interval Constraint Logic Programming. In A. Podelski editor
Optimization of Logic Queries with MIN and MAX Predicates - Greco, Zaniolo, Ganguly (1998)(Correct)
We propose an algorithm for pushing min and max aggregates
into recursive predicates, while preserving query equivalence under
certain monotonicity constraints. The transformed query is often safe
w... / and Herbrand model of logic programming. Definition . A special br of Deductive Databases and Logic Programming Minker ed. . .
An Inductive Logic Programming Framework to Learn a Concept from.. - Bouthinon, Soldano (1998)(Correct)
We address a learning problem with the following peculiarity : we search for
characteristic features common to a learning set of objects related to a target concept. In
particular we approach the ca... / An Inductive Logic Programming Framework to Learn a br problem using an Inductive Logic Programming framework close to
The List Introduction Strategy for. . . - Pettorossi, Proietti (1998)(Correct)
We present a new program transformation strategy based on the introduction of lists. This strategy is an extension of the tupling strategy which is based on the introduction of tuples of xed length. T... / program transformation logic programming transformation rules br in In the case of logic programming these strategies work by
Combining introspection and communication with rationality and.. - Dell'Acqua, Sadri, Toni (1998)(Correct)
We propose a logic-based language for programming agents
that can reason about their own beliefs as well as the beliefs of other
agents and can communicate with each other. The agents can be reactiv... / to agents within an extended logic programming framework. In the remainder br Proc. th Intl. Conf. on Logic Programming pages - Cambridge
An Experimental Comparison of Genetic Programming and Inductive Logic .. - Lappoon Tang (1998)(Correct)
This paper experimentally compares three approaches to program
induction: inductive logic programming (ILP), genetic programming (GP),
and genetic logic programming (GLP) (a variant of GP for inducing... / Programming and Inductive Logic Programming on Learning Recursive List br program induction inductive logic programming ILP genetic programming
Querying Clocked Databases - Orgun, Liu (1998)(Correct)
We propose a temporal extension of Datalog which can be used to
model and query temporal databases with relations based on multiple clocks.
The extension, called Clocked Temporal Datalog, is based o... / Temporal extensions based on logic programming are considered by Chomicki br because their properties in a logic programming setting have not been
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
Fixpoint 3-valued semantics for autoepistemic logic - Denecker, Marek, Truszczy'nski (1998)(Correct)
The paper presents a constructive 3-valued semantics
for autoepistemic logic (AEL). We introduce
a derivation operator and define the semantics
as its least fixpoint. The semantics is
3-valued in the ... / semantics and connections to logic programming. Autoepistemic logic is br the well-founded semantics in logic programming. Deciding whether an atom is
Computational Geometry Problems in REDLOG - Sturm, Weispfenning (1998)(Correct)
We solve algorithmic geometrical problems in real 3-space
or the real plane arising from applications in the area of cad, computer
vision, and motion planning. The problems include parallel and cent... / In contrast to constraint logic programming systems Col the
The Cassowary Linear Arithmetic Constraint Solving Algorithm.. - Badros, Borning (1998)(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
Introduction to the Relationlog System - Shan, Lin (1998)(Correct)
Advanced applications require construction, efficient access and management of large
databases with rich data structures and inference mechanisms. However, such capabilities
are not directly supported... / grew out of the integration of logic programming and relational database br of the International Logic Programming Symposium ILPS pages
Dialectical Proof Theory for Defeasible Argumentation With Defeasible .. - Prakken (1998)(Correct)
In this paper a dialectical proof theory is proposed for logical
systems for defeasible argumentation that fit a certain format. This
format is the abstract theory developed by Dung, Kowalski and ot... / for a system of extended logic programming presented in which in br of his semantics to extended logic programming. In and the
Join Evaluation Schemata for Constraint Handling Rules (CHR) - Holzbaur, Frühwirth (1998)(Correct)
CHR is a committed-choice language consisting of guarded rules that
rewrite constraints into simpler ones until they are solved. CHR can define
both simplification of and propagation over user-defined... / the general-purpose concurrent logic programming languages Sha br with concurrent constraint logic programming e.g. Sha VH Sar
Semantics for using Stochastic Constraint Solvers in Constraint Logic .. - Stuckey, Tam (1998)(Correct)
F4.729e+05>
This paper proposes a number of models for integrating finitedomain
stochastic constraint solvers into constraint logic programming
systems to solve constraint-satisfaction problems e#ci... / The Journal of Functional and Logic Programming The MIT Press Volume br The Journal of Functional and Logic Programming is a peer-reviewed and
Towards a Fluent Logic Programming - Pallotta, Turini (1998)(Correct)
This work involves two areas of research in computer science, namely Knowledge Representation and Logic Programming. Starting from the formalism proposed in Features & Fluents by Erik Sandewall for de... / TR- - Towards a Fluent Logic Programming Pallotta Vincenzo br Towards a Fluent Logic Programming Vincenzo Pallotta and
Resolution in the Smyth Powerdomain - Zhang, Rounds (1998)(Correct)
The purposes of this paper are (i) to give a new, efficient representation of Smyth
powerdomains as 0-inhabited information systems, following the style of Scott; (ii) to
introduce, as a consequence o... / as used in the area of logic programming. Introduction This br for describing disjunctive logic programming is already present in the
Distributed Haskell: Goffin On The Internet - Chakravarty, Guo, Kohler (1998)(Correct)
this paper is on language design, i.e., we neither deøne the semantics of the new language features formally nor do we detail the implementation of these features. Instead, we informally discuss the m... / Symposium on Functional and Logic Programming World Scientic . br is a familiar technique in logic programming and indeed farm can be
Compiling Horn-Clause Rules in IBM's Business System 12 an Early.. - Boas-Lubsen, Boas (1998)(Correct)
The tight connection which exists between the fragment of Prolog now known by
the name Datalog [28] and the various calculi and algebras for Relational Database Systems
was observed at several place... / Prolog the concept of Logic Programming became a prominent activity br in the fields of Databases Logic Programming and Artificial Intelligence
Building Reusable Software Components for Heuristic Search - Fink, Voß, Woodruff (1998)(Correct)
Today, advanced heuristic approaches for discrete optimization are usually
implemented from scratch. We discuss some crucial problems that have so far
prevented us from having a "heuristics stockroom"... / Another example is constraint logic programming with logical constraints as br class-libraries for constraint logic programming such as ILOG Solver