In "expert systems"and other applications of logicprogramming, the issue arises of whether to use rules for forward or backward inference, i.e. whether deduction should be driven by the facts available to t...
详细信息
We prove two properties of logic programs under the answer set semantics that may be useful in connection with applications of logicprogramming to representing causality and to planning. One theorem is about the use ...
详细信息
ISBN:
(纸本)3540667490
We prove two properties of logic programs under the answer set semantics that may be useful in connection with applications of logicprogramming to representing causality and to planning. One theorem is about the use of disjunctive rules to express that an atom is exogenous. the other provides an alternative way of expressing that a plan does not include concurrently executed actions.
In this paper, we consider the problem of scheduling n jobs in an m-machine permutation flowshop with time lags between consecutive operations of each job. the processing order of jobs is the same for each machine. th...
详细信息
ISBN:
(纸本)9781467358149;9781467358125
In this paper, we consider the problem of scheduling n jobs in an m-machine permutation flowshop with time lags between consecutive operations of each job. the processing order of jobs is the same for each machine. the time lag is defined as the waiting time between consecutive operations. We use square logic-based Benders decomposition to minimize the total number of tardy jobs with long time horizon defined on the last machine. We combine Mixed Integer Linear programming (MILP) to allocate jobs to time intervals of the time horizon and scheduled using Constraint programming (CP). Also, a lower bound based on Moore's algorithm is developed. then, computational results are reported.
When confronted with constraint satisfaction problems (CSP). the "generate & test" strategy of Prolog is particulary inefficient. Also, control mechanisms defined for logicprogramming languages fall sho...
详细信息
this paper presents a debugger for Prolog ‘PROEDIT2’, In order to express the complex execution mechanism of Prolog, a new execution model for Prolog ‘BPM’ is also proposed. PROEDIT2 shows the execution of Prolog ...
详细信息
A procedure is proposed leading to an optimal detailed design of reinforced concrete members. the general scheme followed is that of a multi-criterion design optimization. the method synthesizes the information from t...
详细信息
A procedure is proposed leading to an optimal detailed design of reinforced concrete members. the general scheme followed is that of a multi-criterion design optimization. the method synthesizes the information from the cross-sectional level, to the member level and finally, to a group of members where the detailed design of the whole group is decided. At the cross-sectional level, the required reinforcement in cm(2) is converted into reinforcing bars of all possible diameters. At the member and/or group of members level, a number of lists that contain different design scenarios are generated. the method of objective weighting is applied to a multi-criterion objective function, which represents a compromise of the 'minimum weight', 'maximum uniformity' and 'minimum number of reinforcing bars' criteria. By varying the weighting factors, it is possible to generate the Pareto optimal set of the problem. the performance of the system is illustrated with a number of examples. the same building is designed using different weighting factors in the multi-criterion objective. the variation of the detailed designs is discussed and certain values for the weighting factors are recommended. Copyright (C) 1996 Civil-Comp Limited and Elsevier Science Limited.
Two related algorithms for implementing parallel n-bit binary addition and evaluating n-th degree polynomials, respectively, are presented. the approach taken makes use of an iterative construction, the computation tr...
详细信息
Two related algorithms for implementing parallel n-bit binary addition and evaluating n-th degree polynomials, respectively, are presented. the approach taken makes use of an iterative construction, the computation tree. the algorithms are particularly effective for moderate values of n and are in accord with well-known asymptotic bounds. In the case of n-bit addition, the implementations constitute lookahead tree circuits of r-input standard logic elements. Extensions to modular tree structures for lookahead adders are also considered. In the case of parallel polynomial evaluation, the operations of ordinary addition and multiplication are assumed withthe capability to employ r arguments simultaneously.
this conference proceedings contains 10 papers. Topics covered include: compositional semantics for logic programs;closed-world assumptions to well-founded semantics;logic program synthesis;realizability interpretatio...
详细信息
this conference proceedings contains 10 papers. Topics covered include: compositional semantics for logic programs;closed-world assumptions to well-founded semantics;logic program synthesis;realizability interpretation of coninductive definitions and program synthesis with streams;defining concurrent processes;an abstract machine for concurrent modular sytems;computer programming language MLOG;duality of abduction and model generation;and, feature constraint system for logicprogramming.
Hybridisation is a systematic process along which the characteristic features of hybrid logic, both at the syntactic and the semantic levels, are developed on top of an arbitrary logic framed as an institution. In a s...
详细信息
Hybridisation is a systematic process along which the characteristic features of hybrid logic, both at the syntactic and the semantic levels, are developed on top of an arbitrary logic framed as an institution. In a series of papers this process has been detailed and taken as a basis for a specification methodology for reconfigurable systems. the present paper extends this work by showing how a proof calculus (in both a Hilbert and a tableau based format) for the hybridised version of a logic can be systematically generated from a proof calculus for the latter. Such developments provide the basis for a complete proof theory for hybrid(ised) logics, and thus pave the way to the development of (dedicated) proof support. (C) 2016 Elsevier B.V. All rights reserved.
暂无评论