We present a program logic for reasoning about resource consumption of programs written in Grail, an abstract fragment of the Java Virtual Machine Language. Serving as the target logic of a certifying compiler, the lo...
详细信息
Many frameworks have been proposed to manage uncertain information in logicprogramming. Essentially, they differ in the underlying notion of uncertainty and how this paper is to allow the reasoning withnon-uniform d...
详细信息
ISBN:
(纸本)3540206426
Many frameworks have been proposed to manage uncertain information in logicprogramming. Essentially, they differ in the underlying notion of uncertainty and how this paper is to allow the reasoning withnon-uniform default assumptions, i.e. with any arbitrary assignment of default values to the atoms. Informally, rather than to rely on the same default certainty value for all atoms, we allow arbitrary assignments to complete information. To this end, we define both epistemologically and computationally the semantics according to any given assumption. For reasons of generality, we present our work in the framework presented in [17] as a unifying umbrella for many of the proposed approaches to the management of uncertainty in logicprogramming. Our extension is conservative in the following sense: (i) if we restrict our attention to the usual uniform Open World Assumption, then the semantics reduces to the Kripke-Kleene semantics, and (ii) if we restrict our attention to the uniform Closed World Assumption, then our semantics reduces to the well-founded semantics.
the addition of preferences to normal logic pro-rams is a convenient way to represent many aspects of default reasoning. If the derivation of an atom A(1) is preferred to that of an atom A(2) a preference rule can be ...
详细信息
the addition of preferences to normal logic pro-rams is a convenient way to represent many aspects of default reasoning. If the derivation of an atom A(1) is preferred to that of an atom A(2) a preference rule can be defined so that A(2) is derived only if A(1) is not. Although such situations can be modelled directly using default negation, it is often easier to define preference rules than it is to add negation to the bodies of rules. As first noted by Govindarajan et al. [Proc. Internat. Conf. on logicprogramming, 1995, pp. 731-746], for certain grammars, it may be easier to disambiguate parses using preferences than by enforcing disambiguation in the grammar rules themselves. In this paper we define a general fixed-point semantics for preference logic programs based on an embedding into the well-founded semantics, and discuss its features and relation to previous preference logic semantics. We then study how preference logic grammars are used in data standardization, the commercially important process of extracting useful information from poorly structured textual data. this process includes correcting misspellings and truncations that occur in data, extraction of relevant C, 41 information via parsing, and correcting inconsistencies in the extracted information. the declarativity of Prolog offers natural advantages for data standardization, and a commercial standardizer has been implemented using Prolog. However, we show that the use of preference logic grammars allow construction of a much more powerful and declarative commercial standardizer, and discuss in detail how the use of the non-monotonic construct of preferences leads to improved commercial software. (C) 2002 Elsevier Science B.V. All rights reserved.
Summary form only given. this research focuses on the problem of the semantic linking and co-evolution of the different design diagrams and models of an object-oriented software application. the blueprint of an object...
详细信息
ISBN:
(纸本)9780769517360
Summary form only given. this research focuses on the problem of the semantic linking and co-evolution of the different design diagrams and models of an object-oriented software application. the blueprint of an object-oriented software application consists mainly of models drawn in a modeling language. the state-of-the-art modeling language in object-oriented software development is the Unified Modeling Language (UML). Our research hypothesis is that using decidable fragments of first order logic to express the different UML diagrams enables the semantic linking of the different diagrams and models and enables the support of co-evolution which can be semi-automated, enhancing the reusability, maintainability and understandability of the design of the software application and of the software application in general. We propose to develop a formal framework to support the linking of the different diagrams and models within the software development life cycle (SDLC). the advantages of such a framework are: reasoning capabilities are provided, co-evolution is more guaranteed, adaptability of the design is improved and reuse and understandability of the software design increases. To support co-evolution of the design models in a semi-automatic way we investigate the query capabilities of these logic families.
Multi-adjoint logic programs has been recently introduced [9, 10] as a generalization of monotoniclogic programs [2, 3], in that simultaneous use of several implications in the rules and rather general connectives in...
详细信息
Default logic is recognized as a powerful framework for knowledge representation and incomplete information management. Its expressive power is suitable for nonmonotonicreasoning, but the counterpart is its very hig...
详细信息
In a previous work we have defined monotoniclogic Programs which extend definite logicprogramming to arbitrary complete lattices of truth-values with an appropriate notion of implication. We have shown elsewhere tha...
详细信息
I report about a particular approach to heterogenous agent systems, IMPACT, which is strongly related to computational logic. the underlying methods and techniques stem from bothnon-monotonicreasoning and logic prog...
详细信息
the proceedings contain 31 papers. the special focus in this conference is on logicprogramming. the topics include: Solving the multiplication constraint in several approximation spaces;design of syntactic program tr...
ISBN:
(纸本)9783540429357
the proceedings contain 31 papers. the special focus in this conference is on logicprogramming. the topics include: Solving the multiplication constraint in several approximation spaces;design of syntactic program transformations by abstract interpretation of semantic transformations;building real-life applications with prolog;a close look at constraint-based concurrency;probabilistic databases and logicprogramming;understanding memory management in prolog systems;on a tabling engine that can exploit or-parallelism;revisiting the cardinality operator and introducing the cardinality-path constraint family;optimizing compilation of constraint handling rules;practical aspects for a working compile time garbage collection system for mercury;positive boolean functions as multiheaded clauses;speculative beats conservative justification;local and symbolic bisimulation using tabled constraint logicprogramming;a simple scheme for implementing tabled logicprogramming systems based on dynamic reordering of alternatives;ultimate well-founded and stable semantics for logic programs with aggregates;alternating fixed points in boolean equation systems as preferred stable models;semantics of normal logic programs with embedded implications;a multi-adjoint logic approach to abductive reasoning;an order-sorted resolution with implicitly negative sorts;logicprogramming in a fragment of intuitionistic temporal linear logic;a computational model for functional logic deductive databases and a logicprogramming approach to the integration, repairing and querying of inconsistent databases.
We propose a new definition of abduction in logicprogramming, and contrast it withthat of Kakas and Mancarella's. We then introduce a rewriting system for answering queries and generating explanations, and show ...
详细信息
We propose a new definition of abduction in logicprogramming, and contrast it withthat of Kakas and Mancarella's. We then introduce a rewriting system for answering queries and generating explanations, and show that it is both sound and complete under the partial stable model semantics and sound and complete under the answer set semantics when the underlying program is so-called odd-loop free. We discuss an application of the work to a problem in reasoning about actions and provide some experimental results.
暂无评论