logic programming is a very important issue in programming for machine tools, especially for decision-making for machine operations. First, this paper presents a survey on some of the mathematical approaches for logic...
详细信息
ISBN:
(纸本)0387344020
logic programming is a very important issue in programming for machine tools, especially for decision-making for machine operations. First, this paper presents a survey on some of the mathematical approaches for logic programming. Second, it presents a case study on logic programming a flexible manufacturing cell.
The widespread diffusion of low-cost computing devices, such as Arduino boards and Raspberry Pi, along with improvements of Cloud computing platforms, are paving the way towards a whole new set of opportunities for In...
详细信息
ISBN:
(纸本)9781509044290
The widespread diffusion of low-cost computing devices, such as Arduino boards and Raspberry Pi, along with improvements of Cloud computing platforms, are paving the way towards a whole new set of opportunities for Internet of Things (loT) applications and services. Varying degrees of intelligence are often required for supporting adaptation and self-management-yet, they should be provided in a light-weight, easy to use and customise, highly-interoperable way. Accordingly, in this paper we explore the idea of logic programming as a Service (LPaaS) as a novel and promising re-interpretation of distributed logic programming in the loT era. After introducing the reference context and motivating scenarios of LPaaS as a key enabling technology for intelligent loT, we define the LPaaS general system architecture. Then, we present a prototype implementation built on top of the tuProlog system, which provides the required interoperability and customisation. We showcase the LPaaS potential through a case study designed as a simplification of the motivating scenarios.
The pure prolog evaluation of a goal yields a list of answers, but the tools provided for manipulating these structures are very poor. We discuss augmenting pure prolog with a list comprehension construct that offers ...
详细信息
The pure prolog evaluation of a goal yields a list of answers, but the tools provided for manipulating these structures are very poor. We discuss augmenting pure prolog with a list comprehension construct that offers the possibility of referring to the finite or infinite list of answers produced. Thus meta-predicates can be defined. A substructural calculus is used to give an axiomatic semantics to the extended language. Soundness and completeness of the intended evaluation with respect to this semantics is proved.
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.
This paper deals with an object-oriented approach to analysis, design, and implementation of constraint logic programming (CLP) for a timetabling system (TTS). Currently, it is difficult to maintain and port such syst...
详细信息
This paper deals with an object-oriented approach to analysis, design, and implementation of constraint logic programming (CLP) for a timetabling system (TTS). Currently, it is difficult to maintain and port such systems to different environments. This is because by nature, timetabling problems are combinatorial, dynamics, and optimization-based. Using a conventional approach, changes to organization's policies and activities require updating of the model. Subsequently, computer programs need to be updated accordingly. These tasks have to be performed by experts who are scarcely available. In this paper, we show that maintainability and extendibility of object-oriented technologies enhance model formulation and maintenance by inheritance and polymorphism properties of classes and objects. The object-oriented approach also enhances constraint propagation and search by object interactions and communications. These advantages can be applied to other similar optimization-based systems such as planning and scheduling.
In this paper, we outline a proof procedure which combines reasoning with defined predicates together with reasoning with undefined, abducible, predicates. Defined predicates are defined in if-and-only-if form. Abduci...
详细信息
In this paper, we outline a proof procedure which combines reasoning with defined predicates together with reasoning with undefined, abducible, predicates. Defined predicates are defined in if-and-only-if form. Abducible predicates are constrained by means of integrity constraints. Given an initial query, the task of the proof procedure is to construct a definition of the abducible predicates and a substitution for the variables in the query, such that both the resulting instance of the query and the integrity constraints are implied by the extended set of definitions. The iff proof procedure can be regarded as a hybrid of the proof procedure of Console et al. and the SLDNFA procedure of Denecker and De Schreye. It consists of a number of inference rules which, starting from the initial query, rewrite a formula into an equivalent formula. These rules are: 1) unfolding, which replaces an atom by its definition;2) propagation, which resolves an atom with an implication;3) splitting, which uses distributivity to represent a goal as a disjunction of conjunctions;4) case analysis for an equality X=t in the conditions of an implication, which considers the two cases X=t and X not equal t;5) factoring of two abducible atoms, which considers the two cases, where the atoms are identical and where they are different, 6) rewrite rules for equality, which simulate the unification algorithm;and 7) logical simplifications, such as A boolean AND false <-> false. The proof procedure is both sound and complete relative to the three-valued completion semantics. These soundness and completeness results improve previous results obtained for other proof procedures. (C) Elsevier Science Inc., 1997.
The paper provides an overview of the s-semantic approach to the semantics of logic programs which had been developed about twenty years ago. The aim of such an approach was that of providing a suitable base for progr...
详细信息
The paper provides an overview of the s-semantic approach to the semantics of logic programs which had been developed about twenty years ago. The aim of such an approach was that of providing a suitable base for program analysis by means of a semantics which really captures the operational behavior of logic programs, and thus offers useful notions of observable program equivalences. The semantics is given in terms of extended interpretations, which are more expressive than Herbrand interpretations, extends the standard Herbrand semantics, and can be obtained as a result of both top-down and bottom-up constructions. The approach has been applied to several extensions of positive logic programs and used to develop semantic-based techniques for program analysis, verification and transformation. (C) 2009 Elsevier B.V. All rights reserved.
Inductive logic programming (ILP) is a new discipline which investigates the inductive construction of first-order clausal theories from examples and background knowledge. We survey the most important theories and met...
详细信息
Inductive logic programming (ILP) is a new discipline which investigates the inductive construction of first-order clausal theories from examples and background knowledge. We survey the most important theories and methods of this new field. First, various problem specifications of ILP are formalized in semantic settings for ILP, yielding a ''model-theory'' for ILP. Second, a generic ILP algorithm is presented. Third, the inference rules and corresponding operators used in ILP are presented, resulting in a ''proof-theory'' for ILP. Fourth, since inductive inference does not produce statements which are assured to follow from what is given, inductive inferences require an alternative form of justification. This can take the form of either probabilistic support or logical constraints on the hypothesis language. Information compression techniques used within ILP are presented within a unifying Bayesian approach to confirmation and corroboration of hypotheses. Also, different ways to constrain the hypothesis language or specify the declarative bias are presented. Fifth, some advanced topics in ILP are addressed. These include aspects of computational learning theory as applied to ILP, and the issue of predicate invention. Finally, we survey some applications and implementations of ILP. ILP applications fall under two different categories: first, scientific discovery and knowledge acquisition, and second, programming assistants.
The first logic programming languages, such as Prolog, used a fixed left-to-right atom scheduling rule. Recent logic programming languages, however, provide more flexible scheduling in which there is a default computa...
详细信息
The first logic programming languages, such as Prolog, used a fixed left-to-right atom scheduling rule. Recent logic programming languages, however, provide more flexible scheduling in which there is a default computation rule such as left-to-right but in which some calls are dynamically ''delayed'' until their arguments are sufficiently instantiated to allow the call to run efficiently. Such languages include constraint logic programming languages, since most implementations of these languages delay constraints which are ''too hard.'' From the semantic point of view, the fact that an atom must be delayed under certain conditions, causes the standard semantics of (constraint) logic programming to be no longer adequate to capture the meaning of a program. In our paper we attack this problem and we develop a denotational semantics for constraint logic programming with dynamic scheduling. The key idea is that the denotation of an atom or goal is a set of closure operators, where different closure operators correspond to different sequences of rule choices. (C) 1997 Academic Press.
Dr. Furukawa had a sharp view in pinpointing that the crucial issue in skill science lies in discovering missing parts, that it is an act of abductive thinking, and that logic programming can be best used to encourage...
详细信息
Dr. Furukawa had a sharp view in pinpointing that the crucial issue in skill science lies in discovering missing parts, that it is an act of abductive thinking, and that logic programming can be best used to encourage people, who intend to learn embodied skills, to think and feel more than without it. In the wake of the grief that our communities lost Dr. Furukawa, discussions on implications that his great contributions to AI, cognitive science and skill science have brought to us are a necessary must for all that keep doing researches for people's well-being.
暂无评论