the idea of answer set programming is to represent a given computational problem by a logic program whose answer sets correspond to solutions, and then use an answer set solver, such as SMODELS or DLV, to find an answ...
详细信息
the idea of answer set programming is to represent a given computational problem by a logic program whose answer sets correspond to solutions, and then use an answer set solver, such as SMODELS or DLV, to find an answer set for this program. Applications of this method to planning are related to the line of research on the frame problem that started withthe invention of formal nonmonotonic reasoning in 1980. (C) 2002 Elsevier Science B.V. All rights reserved.
In this paper I will present a deductive system for linear logic, in which all rules are local. In particular, the contraction rule is reduced to an atomic version, and there is no global promotion rule. In order to a...
详细信息
ISBN:
(纸本)3540000100
In this paper I will present a deductive system for linear logic, in which all rules are local. In particular, the contraction rule is reduced to an atomic version, and there is no global promotion rule. In order to achieve this, it is necessary to depart from the sequent, calculus and use the calculus of structures, which is a generalization of the one-sided sequent calculus. In a rule, premise and conclusion are not sequents, but structures, which are expressions that share properties of formulae and sequents.
We define an extension of predicate logic, called Binding logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem ...
详细信息
ISBN:
(数字)9783540360780
ISBN:
(纸本)3540000100
We define an extension of predicate logic, called Binding logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. this theorem is obtained by encoding this logic back into predicate logic and using the classical soundness and completeness theorem there.
In the paper, we present a procedural semantics for fuzzy disjunctive programs - sets of graded strong literal disjunctions. We shall suppose that truth values constitute a complete Boolean lattice L = (L, less than o...
详细信息
ISBN:
(数字)9783540360780
ISBN:
(纸本)3540000100
In the paper, we present a procedural semantics for fuzzy disjunctive programs - sets of graded strong literal disjunctions. We shall suppose that truth values constitute a complete Boolean lattice L = (L, less than or equal to, boolean OR, boolean AND, double right arrow, 0, 1). A graded strong literal disjunction is a pair (D, c) where D is a strong literal disjunction of the form l(1)(V) over dot ... (V) over dot l(n) and c is a truth value from the lattice L. A graded disjunction can be understood as a means of the representation of incomplete and uncertain information, where the incompleteness is formalised by its strong literal disjunction, while the uncertainty by its truth degree. In the end, the coincidence of the procedural and fixpoint semantics, proposed in [18], will be reached.
We provide a denotational semantics for first-order logicthat captures the two-level view of the computation process typical for constraint programming. At one level we have the usual program execution. At the other ...
详细信息
ISBN:
(数字)9783540360780
ISBN:
(纸本)3540000100
We provide a denotational semantics for first-order logicthat captures the two-level view of the computation process typical for constraint programming. At one level we have the usual program execution. At the other level an automatic maintenance of the constraint store takes place. We prove that the resulting semantics is sound with respect to the truth definition. By instantiating it by specific forms of constraint management policies we obtain several sound evaluation policies of first-order formulas. this semantics can also be used a basis for sound implementation of constraint maintenance in presence of block declarations and conditionals.
this paper presents an analysis of Godel logics with countable truth value sets with respect to the topological and order theoretic structure of the underlying truth value set. Godel logics have taken an important rol...
详细信息
ISBN:
(纸本)3540000100
this paper presents an analysis of Godel logics with countable truth value sets with respect to the topological and order theoretic structure of the underlying truth value set. Godel logics have taken an important role in various areas of computer science, e.g. logicprogramming and foundations of parallel computing. As shown in a forthcoming paper all these logics are not recursively axiomatizable. We show that certain topological properties of the truth value set can distinguish between various logics. Complete separation of a class of countable valued logics will be proven and direction for further separation results given.
We present a definition of a Fuzzy Prolog Language that models interval-valued Fuzzy logic, and subsumes former approaches because it uses a truth value representation based on a union of intervals of real numbers and...
详细信息
ISBN:
(纸本)3540000100
We present a definition of a Fuzzy Prolog Language that models interval-valued Fuzzy logic, and subsumes former approaches because it uses a truth value representation based on a union of intervals of real numbers and it is defined using general operators that can model different logics. We give the declarative and procedural semantics for Fuzzy logic programs. In addition, we present the implementation of an interpreter for this language conceived using CLP(R). We have incorporated uncertainty into a Prolog system in a simple way thanks to this constraints system. the implementation is based on a syntactic expansion of the source code during the Prolog compilation.
Description logics knowledge bases axe traditionally divided into a terminological part (Tbox), and an assertional part (Abox). However, most of recent results on practical algorithms are confined to terminological re...
详细信息
ISBN:
(纸本)3540000100
Description logics knowledge bases axe traditionally divided into a terminological part (Tbox), and an assertional part (Abox). However, most of recent results on practical algorithms are confined to terminological reasoning only. Due to the applications of Description logics for databases and the so-called "Semantic Web", there is a growing interest for practical algorithms for Abox reasoning. In this paper we present an algorithm for deciding knowledge base satisfiability based on the idea of separating terminological and assertional reasoning. this modularity allows to build complete Description logics systems, by reusing available terminological reasoners.
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Parallelism constraints belong to the constrai...
详细信息
ISBN:
(纸本)3540000100
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Parallelism constraints belong to the constraint language for lambda structures (CLLS) which serves for modeling natural language semantics. In this paper, we investigate the extension of parallelism constraints by tree regular constraints. this canonical extension is subsumed by the monadic second-order logic over parallelism constraints. We analyze the precise expressiveness of this extension on basis of a new relationship between tree automata and logic. Our result is relevant for classifying different extensions of parallelism constraints, as in CLLS. Finally, we prove that parallelism constraints and context unification remain equivalent when extended with tree regular constraints.
the development of industrial-size software is an evolutionary process based on structured specifications. In a formal setting, specification and verification are intertwined. Specifications are amended either to add ...
详细信息
ISBN:
(数字)9783540360780
ISBN:
(纸本)3540000100
the development of industrial-size software is an evolutionary process based on structured specifications. In a formal setting, specification and verification are intertwined. Specifications are amended either to add new functionality or to fix bugs detected during the verification process. In this paper we propose a system to maintain the verification of formal developments. It exploits the structure of the specification to reveal and eliminate redundant proof obligations and therefore constitutes itself a verification system in-the-large. Proofs in this system are represented as explicit proof objects allowing the system to adjust or reuse them in case the specification is changed.
暂无评论