We introduce inductive definitions over language expressions as a framework for specifying tree tuple languages. Inductive definitions and their subclasses correspond naturally to classes of logic programs, and operat...
详细信息
We introduce inductive definitions over language expressions as a framework for specifying tree tuple languages. Inductive definitions and their subclasses correspond naturally to classes of logic programs, and operations on tree tuple languages correspond to the transformation of logic programs. We present an algorithm based on unfolding and definition introduction that is able to deal with several classes of tuple languages in a uniform way. Termination proofs for clause classes translate directly to closure properties of tuple languages, leading to new decidability and computability results for the latter.
A temporal-constraint logic programming framework for the specification and automatic verification and synthesis of assembly sequences is developed. The implemented tool is based on the formulated and derived preceden...
详细信息
A temporal-constraint logic programming framework for the specification and automatic verification and synthesis of assembly sequences is developed. The implemented tool is based on the formulated and derived precedence properties for a general mechanical assembly. This tool, called the Mechanical Assembly Sequence Satisfiability Checker (MASS-C), supports the use of a subset of temporal logic for assembly constraint specification. MASS-C provides the logic programming framework by which the designer can be relieved of the tedium of finding the assembly sequences, and the assembly sequence planning process manifests itself in the implicit modelling of assembly sequences by acquiring and formulating the set of correct and complete assembly constraints as a logic program. MASS-C implements a class of temporal expressions as predicates for logic programming of assembly constraints. It provides facilities to either verify an assembly sequence or synthesise all assembly sequences that satisfy the specified constraints composed as a logic program. Two examples illustrate the use of MASS-C for such verification and synthesis.
In this paper we describe an effective approach to design, implement, and operate a traffic control system based on logic programming. With this approach it is possible to implement very flexible control strategies th...
详细信息
In this paper we describe an effective approach to design, implement, and operate a traffic control system based on logic programming. With this approach it is possible to implement very flexible control strategies that can be easily developed by traffic engineers using a simple description language. An important feature of the system is the use of a very efficient logic programming solver, the Leibniz System, which is capable of generating fast solution algorithms for the decision problems associated with traffic signal setting. A micro-simulator has been developed to verify the effectiveness of the method. It is a crucial tool of an integrated development system, that allows one to develop control strategies and to test them before their on-field implementation. An application to a real case is described and experimental results are presented. (c) 2006 Published by Elsevier Ltd.
In this paper, we describe the research lines in logic programming, carried out in Cosenza over a period of more than 20 years, which have recently produced promising industrial exploitation follow-ups. The research l...
详细信息
In this paper, we describe the research lines in logic programming, carried out in Cosenza over a period of more than 20 years, which have recently produced promising industrial exploitation follow-ups. The research lines have changed over the time but they have kept the initial interest on combining logic programming with databases techniques, that has been continuously renewed to cope with new challenges, in our attempt to use theory to solve practical problems.
This paper explores the use of Answer Set programming (ASP) in solving Distributed Constraint Optimization Problems (DCOPs). The paper provides the following novel contributions: (1) it shows how one can formulate DCO...
详细信息
This paper explores the use of Answer Set programming (ASP) in solving Distributed Constraint Optimization Problems (DCOPs). The paper provides the following novel contributions: (1) it shows how one can formulate DCOPs as logic programs;(2) it introduces ASP-DPOP, the first DCOP algorithm that is based on logic programming;(3) it experimentally shows that ASP-DPOP can be up to two orders of magnitude faster than DPOP (its imperative programming counterpart) as well as solve some problems that DPOP fails to solve, due to memory limitations;and (4) it demonstrates the applicability of ASP in a wide array of multi-agent problems currently modeled as DCOPs.
作者：
DARVAS, FUNIV FLORIDA
J HILLIS MILLER HLTH CTRCOLL PHARMCTR DRUG DESIGN & DELIVERYGAINESVILLEFL 32610
This paper discusses logic programming and its application for the expert system I use to simulate the metabolic fate of substances. An expert system called Metabolexpert accepts the formula of the compound to be meta...
详细信息
This paper discusses logic programming and its application for the expert system I use to simulate the metabolic fate of substances. An expert system called Metabolexpert accepts the formula of the compound to be metabolized and produces a treelike picture of the metabolites generated together with the formula of the compounds. On request, three-dimensional (3D) pictures of the metabolites are also displayed and hydrophobicity (logP) values of the compounds calculated. A retrospective investigation of Metabolexpert's achievement showed that the expert system can reproduce almost all primary, secondary and tertiary metabolites of amphetamine. A compound series has been suggested for benchmark testing of metabolic transformation knowledge bases.
Our purpose is to exhibit a modular systematic method of representing non-monotonic reasoning problems with the Well Founded Semantics WFS of extended logic programs augmented with explicit negation (WFSX), augmented ...
详细信息
Our purpose is to exhibit a modular systematic method of representing non-monotonic reasoning problems with the Well Founded Semantics WFS of extended logic programs augmented with explicit negation (WFSX), augmented by its Contradiction Removal Semantics (CRSX) when needed. We apply this semantics, and its contradiction removal semantics counterpart, to represent non-monotonic reasoning problems. We show how to cast in the language of logic programs extended with explicit negation such forms of non-monotonic reasoning as defeasible reasoning, abductive reasoning, and hypothetical reasoning and apply them to such different domains of knowledge representation as hierarchies and reasoning about actions. We then abstract a modular systematic method of representing non-monotonic problems in a logic programming semantics comprising two forms of negation avoiding some drawbacks of other proposals, with which we relate our work.
Abstract interpretation is a systematic methodology to design static program analysis which has been studied extensively in the logic programming community, because of the potential for optimizations in logic programm...
详细信息
Abstract interpretation is a systematic methodology to design static program analysis which has been studied extensively in the logic programming community, because of the potential for optimizations in logic programming compilers and the sophistication of the analyses which require conceptual support. With the emergence of efficient generic abstract interpretation algorithms for logic programming, the main burden in building an analysis is the abstract domain which gives a safe approximation of the concrete domain of computation. However, accurate abstract domains for logic programming are often complex not only because of the relational nature of logic programming languages and of their typical interprocedural control-flow, but also because of the variety of analyses to perform, their interdependence, and the need to maintain structural information. The purpose of this paper is to propose conceptual and software support for the design of abstract domains. It contains two main contributions: the notion of open product and a generic pattern domain. The open product is a new, language independent, way of combining abstract domains allowing each combined domain to benefit from information from the other components through the notions of queries and open operations. It provides a framework to approximate Cousots' reduced product, while reusing existing implementations and providing methodological guidance on how to build domains for interaction and composition. It is orthogonal and complementary to Granger's product which improves the direct product by a decreasing iteration sequence based on refinements but lets the domains interact only after the individual operations. The generic pattern domain Pat(R) automatically upgrades a domain D with structural information yielding a more accurate domain Pat(D) without additional design or implementation cost. The two contributions are orthogonal and can be combined in various ways to obtain sophisticated domains while imposin
We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic programs. In our formulation, answers of que...
详细信息
We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic programs. In our formulation, answers of queries are defined using disjunctive substitutions, which are more flexible than answer literals used in theorem proving systems.
Constraint logic programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In part...
详细信息
Constraint logic programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in different areas of applications. In this survey of CLP, a primary goal is to give a systematic description of the major trends in terms of common fundamental concepts. The three main parts cover the theory, implementation issues, and programming for applications.
暂无评论