This paper presents a methodology based on a temporal reasoning tool, TEMPER, [5, 6], to model time-sensitive constraints of project management. The classical methods of project management e.g., Critical Path Method (...
详细信息
ISBN:
(纸本)0780365836
This paper presents a methodology based on a temporal reasoning tool, TEMPER, [5, 6], to model time-sensitive constraints of project management. The classical methods of project management e.g., Critical Path Method (see for example [1, 3, 4] for a detailed discussion about CPM) are adequate, however they lose some of the most important properties and requirements of a project. In this paper we present a project management technique, which enhances the language for inputting constraints and offers a modeling approach-that captures aspects that are not covered by traditional methods.
In this position paper rile investigate how logic programing technology call aid software development. The overall goal is to provide a framework for specification and verification that is "computational" in...
详细信息
ISBN:
(纸本)0769509274
In this position paper rile investigate how logic programing technology call aid software development. The overall goal is to provide a framework for specification and verification that is "computational" in nature rather than being based on traditional, more co,complex formalism such as theorem proving and term rewriting. Two approaches are discussed. In the first approach, given a program,written in a traditional language (eg., C), an equivalent logic program is automatically obtained This equivalent logic program serves as a high level abstraction of the original program and call be put to a number of uses including verification, structured debugging and generation of provably correct target code. The second approach is centered around domain specific languages. Given a task for which a software system is to be developed, a high-level domain specific language (DSL) is first designed. Domain experts can nse this DSL for writing programs at their level of abstraction. logic programming provides a framework in which programs written in this DSL can be interpreted, compiled, debugged, verified, and profiled.
Most formalisms for representing common-sense knowledge allow incomplete and potentially inconsistent information. When strong negation is also allowed, contradictory conclusions can arise. A criterion for deciding be...
详细信息
Most formalisms for representing common-sense knowledge allow incomplete and potentially inconsistent information. When strong negation is also allowed, contradictory conclusions can arise. A criterion for deciding between them is needed. The aim of this paper is to investigate an inherent and autonomous comparison criterion, based on specificity as defined in [POO 85, SIM 92]. In contrast to other approaches, we consider not only defeasible, but also strict knowledge. Our criterion is context-sensitive, i. e., preference among defeasible rules is determined dynamically during the dialectical analysis. We show how specificity can be defined in terms of two different approaches: activation sets and derivation trees. This allows us to get a syntactic criterion that can be implemented in a computationally attractive way. The resulting definitions may be applied in general rulebased formalisms. We present theorems linking both characterizations. Finally we discuss other frameworks for defeasible reasoning in which preference handling is considered explicitly.
We present a framework for decision making under uncertainty where the priorities of the alternatives can depend on the situation at hand. We design a logic-programming language, DOP-CLP, that allows the user to speci...
详细信息
ISBN:
(纸本)3540414134
We present a framework for decision making under uncertainty where the priorities of the alternatives can depend on the situation at hand. We design a logic-programming language, DOP-CLP, that allows the user to specify the static priority of each rule and to declare, dynamically, all the alternatives for the decisions that have to be made. In this paper we focus on a semantics that reflects all possible situations in which the decision maker takes the most rational, possibly probabilistic, decisions given the circumstances. Our model theory, which is a generalization of classical logic-programming model theory, captures uncertainty at the level of total Herbrand interpretations. We also demonstrate that DOP-CLPs can be used to formulate game theoretic concepts.
We begin with a review of ordered linear logic (OLL), a refinement of intuitionistic linear logic with an inherent notion of order. We then develop a logic programming interpretation for OLL in two steps: (1) we give ...
详细信息
ISBN:
(纸本)1581132654
We begin with a review of ordered linear logic (OLL), a refinement of intuitionistic linear logic with an inherent notion of order. We then develop a logic programming interpretation for OLL in two steps: (1) we give a system of ordered uniform derivations which is sound and complete with respect to OLL, and (2) we present a model of resource consumption which removes non-determinism from ordered resource allocation during search for uniform derivations. We also illustrate the expressive power of the resulting ordered linear logic programming language with several example programs.
This paper gives denotational models for three logic programming languages of progressive complexity, adopting the "logic programming without logic" approach. The first language is the control flow kernel of...
详细信息
ISBN:
(纸本)1581132654
This paper gives denotational models for three logic programming languages of progressive complexity, adopting the "logic programming without logic" approach. The first language is the control flow kernel of sequential Prolog, featuring sequential composition and backtracking. A committed-choice concurrent logic language with parallel composition (parallel AND) and don't care nondeterminism is studied next. The third language is the core of Warren's basic Andorra model, combining parallel composition and don't care nondeterminism with two forms of don't know nondeterminism (interpreted as sequential and parallel OR) and favoring deterministic over nondeterministic computation. We show that continuations are a valuable tool in the analysis and design of semantic models for both sequential and parallel logic programming. Instead of using mathematical notation, we use the functional programming language Haskell as a metalanguage for our denotational semantics, and employ monads in order to facilitate the transition from one language under study to another.
The LMC project aims to advance the state of the art of system specification and verification using the latest developments in logic programming technology [CDD+98]. Initially, the project was focussed on developing a...
详细信息
The natural representation of solutions of finite constraint satisfaction problems is as a (set of) function(s) or relation(s). In (constraint) logic programming, answers are in the form of substitutions to the variab...
详细信息
ISBN:
(纸本)1581132654
The natural representation of solutions of finite constraint satisfaction problems is as a (set of) function(s) or relation(s). In (constraint) logic programming, answers are in the form of substitutions to the variables in the query. This results in a not very declarative programming style where a table has to be presented as a complex term. Recently, stable logic programming, also called answer set programming and abductive logic programming have been proposed as approaches supporting a more declarative style for solving such problems. The approach developed in this paper is to extend the constraint domain of a constraint logic programming language with open functions, functions for which the interpretation is not fixed in advance. Their interpretation contains the solution of the problem. This enrichment of the constraint domain yields a language which is almost as expressive as abductive logic programming and is very well suited for expressing finite domain constraint satisfaction problems. Implementation requires only to extend the constraint solver of the underlying CLP language.
In this paper we demonstrate how a default theory, expressed through a set of conditional defaults that the agent possesses, can be traduced into extended logic programs. Additionally, the proposed trans-lation allows...
详细信息
In this paper we demonstrate how a default theory, expressed through a set of conditional defaults that the agent possesses, can be traduced into extended logic programs. Additionally, the proposed translation allows ...
详细信息
暂无评论