We investigate the use of multilattices as the set of truth-values underlying a general fuzzy logicprogramming framework. On the one hand, some theoretical results about ideals of a multilattice are presented in orde...
详细信息
We investigate the use of multilattices as the set of truth-values underlying a general fuzzy logicprogramming framework. On the one hand, some theoretical results about ideals of a multilattice are presented in order to provide an ideal-based semantics;on the other hand, a restricted semantics, in which interpretations assign elements of a multilattice to each propositional symbol, is presented and analysed. (C) 2006 Elsevier B.V. All rights reserved.
the theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logicprogramming languages. Two such languages, lambda Prolog and its linear logic refinement, Lolli [15], provide...
详细信息
the theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logicprogramming languages. Two such languages, lambda Prolog and its linear logic refinement, Lolli [15], provide for various forms of abstraction (modules, abstract data types, and higher-order programming) but lack primitives for concurrency. the logicprogramming language, LO (Linear Objects) [2] provides some primitives for concurrency but lacks abstraction mechanisms. In this paper we present Forum, a logicprogramming presentation of all of linear logicthat modularly extends lambda Prolog, Lolli, and LO. Forum, therefore, allows specifications to incorporate both abstractions and concurrency. To illustrate the new expressive strengths of Forum, we specify in it a sequent calculus proof system and the operational semantics of a programming language that incorporates references and concurrency. We also show that the meta theory of linear logic can be used to prove properties of the object-languages specified in Forum.
In this paper, we propose a three-valued completion semantics for abductive logic programs, which solves some problems associated withthe Console et al. two-valued completion semantics. the semantics is a generalizat...
详细信息
In this paper, we propose a three-valued completion semantics for abductive logic programs, which solves some problems associated withthe Console et al. two-valued completion semantics. the semantics is a generalization of Kunen's completion semantics for general logic programs, which is known to correspond very well to a class of effective proof procedures for general logic programs. Secondly, we propose a proof procedure for abductive logic programs, which is a generalization of a proof procedure for general logic programs based on constructive negation. this proof procedure is sound and complete with respect to the proposed semantics. By generalizing a number of results on general logic programs to the class of abductive logic programs, we present further evidence for the idea that limited forms of abduction can be added quite naturally to general logic programs.
programminglogicthinking is the most important competence for computer science students. However, programming is one of the difficult subject in computer science program. this paper reports our work about enhancing ...
详细信息
programminglogicthinking is the most important competence for computer science students. However, programming is one of the difficult subject in computer science program. this paper reports our work about enhancing students' programminglogicthinking using Analogy Mapping for basic programming subject. Analogy Mapping is a computer application which converts source code into analogies images. this research used time series evaluation and the result showed that Analogy Mapping can enhance students' programminglogicthinking.
We present an algebraic embedding of Neighbourhood logic (NL) into the framework of semirings which yields various simplifications. For example, some of the NL axioms can be dropped, since they are theorems in our fra...
详细信息
We present an algebraic embedding of Neighbourhood logic (NL) into the framework of semirings which yields various simplifications. For example, some of the NL axioms can be dropped, since they are theorems in our framework, and Galois connections produce properties for free. A further simplification is achieved, since the semiring methods used are easy and fairly standard. Moreover, this embedding allows us to reuse knowledge from Neighbourhood logic in other areas of Computer Science. Since in its original axiomatisation the logic cannot handle intervals of infinite length and therefore not fully model and specify reactive and hybrid systems, using lazy semirings we introduce an extension of NL to intervals of finite and infinite length. Furthermore, we discuss connections between the (extended) logic and other application areas, like Allen's thirteen relations between intervals, the branching time temporal logic CTL* and hybrid systems. (C) 2007 Elsevier Inc. All rights reserved.
We introduce a compositional characterization of the operational semantics of equational Horn programs. then we show that this semantics and the standard operational semantics based on (basic) narrowing coincide. We d...
详细信息
We introduce a compositional characterization of the operational semantics of equational Horn programs. then we show that this semantics and the standard operational semantics based on (basic) narrowing coincide. We define an abstract narrower mimicking this semantics, and show how it can be used as a basis for efficient AND-compositional program analysis. As an application of our framework, we show a compositional analysis to detect the unsatisfiability of an equation set with respect to a given equational theory. We also show that our method allows us to perform computations and analysis incrementally in a Constraint Equational setting and that the test of satisfiability in this setting can be done in parallel.
We present an algebra that is intended to bridge the gap between programming formalisms that have a high level of abstraction and the operational interpretations these formalisms have been designed to capture. In orde...
详细信息
We present an algebra that is intended to bridge the gap between programming formalisms that have a high level of abstraction and the operational interpretations these formalisms have been designed to capture. In order to piece a high-level formalism sound for its intended operational interpretation, one needs a mathematical handle on the latter. To this end we design the computation calculus. As an expression mechanism, it is sufficiently transparent to avoid begging the question. As an algebra, it is quite powerful and relatively simple. (C) 2000 Published by Elsevier Science B.V. All rights reserved.
We explore the power of relational semantics and equational reasoning in the style of Kleene algebra for analyzing programs with mutable, statically scoped local variables. We provide (i) a fully compositional relatio...
详细信息
We explore the power of relational semantics and equational reasoning in the style of Kleene algebra for analyzing programs with mutable, statically scoped local variables. We provide (i) a fully compositional relational semantics for a first-order programming language with constructs for local variable declaration and destructive update;and (ii) an equational proof system based on Kleene algebra with tests for proving the equivalence of programs in this language. We show that the proof system is sound and complete relative to the underlying equational theory without local variables. We illustrate the use of the system with several examples. (C) 2007 Elsevier Inc. All rights reserved.
Ontologies are one of the important and effective parts of semantic web which constitute the infrastructure and background knowledge of this realm of web science. Finding valid mappings as much as possible between the...
详细信息
ISBN:
(纸本)9781538653647
Ontologies are one of the important and effective parts of semantic web which constitute the infrastructure and background knowledge of this realm of web science. Finding valid mappings as much as possible between the concepts or entities of ontologies, especially for the large ones, is a prominent task to align those concepts together and finally merge and integrate their ontologies to make a general and global ontology that is smaller and more flexible in many applications of semantic web. this paper describes a new learning-based ontology mapping method in which inductive logicprogramming (ILP) is used to learn ontology mapping using information gathered from instances of each entity in order to make some correct and valid alignments between concepts of different ontologies.
暂无评论