Intensional logicprogramming is an extension of logicprogramming based on intensional logic, which includes as special cases both temporal and modal logicprogramming. In [OW92], M. Orgun and W. W. Wadge provided a ...
详细信息
ISBN:
(纸本)9783642405648
Intensional logicprogramming is an extension of logicprogramming based on intensional logic, which includes as special cases both temporal and modal logicprogramming. In [OW92], M. Orgun and W. W. Wadge provided a general framework for capturing the semantics of intensional logicprogramming languages. One key property involved in the construction of [OW92], is the monotonicity of intensional operators. In this paper we consider intensional logicprogramming from a game-theoretic perspective. In particular we define a two-person game and we demonstrate that it is equivalent to the semantics of [OW92]. More importantly, we demonstrate that the game is even applicable to intensional languages withnon-monotonic operators. In this way we provide the first (to our knowledge) general semantic framework for capturing the semantics of non-monotonic intensional logicprogramming.
In this paper we study the relation between the two main extensions of Answer Set programming with temporal modal operators: Temporal Equilibrium logic (TEL) and Temporal Answer Sets (TAS). On the one hand, TEL is a c...
详细信息
ISBN:
(纸本)9783642405648
In this paper we study the relation between the two main extensions of Answer Set programming with temporal modal operators: Temporal Equilibrium logic (TEL) and Temporal Answer Sets (TAS). On the one hand, TEL is a complete non-monotoniclogicthat results from the combination of Linear-time Temporal logic (LTL) with Equilibrium logic. On the other hand, TAS is based on a richer modal approach, Dynamic LTL (DLTL), whereas its non-monotonic part relies on a reduct-based definition for a particular limited syntax. To integrate both approaches, we propose a Dynamic Linear-time extension of Equilibrium logic (DTEL) that allows accommodating both TEL and TAS as particular cases. With respect to TEL, DTEL incorporates more expressiveness thanks to the addition of dynamic logic operators, whereas with respect to TAS, DTEL provides a complete non-monotonic semantics applicable to arbitrary theories. In the paper, we identify cases in which both formalisms coincide and explain how this relation can be exploited for adapting existing TEL and TAS computation methods to the general case of DTEL.
Deontic logicprogramming (DLP) is a framework combining deontic logic and non-monotoniclogicprogramming, and it is useful to represent and reason about normative systems. In this paper we propose an implementation ...
详细信息
Maher (2012) introduced an approach for relative expressiveness of defeasible logics, and two notions of relative expressiveness were investigated. Using the first of these definitions of relative expressiveness, we s...
详细信息
Maher (2012) introduced an approach for relative expressiveness of defeasible logics, and two notions of relative expressiveness were investigated. Using the first of these definitions of relative expressiveness, we show that all the defeasible logics in the DL framework are equally expressive under this formulation of relative expressiveness. the second formulation of relative expressiveness is stronger than the first. However, we show that logics incorporating individual defeat are equally expressive as the corresponding logics with team defeat. thus the only differences in expressiveness of logics in DL arise from differences in how ambiguity is handled. this completes the study of relative expressiveness in DL begun in Maher (2012).
In recent years, Answer Set programming (ASP), logicprogramming under the stable model or answer set semantics, has seen several extensions by generalizing the notion of an atom in these programs: be it aggregate ato...
详细信息
ISBN:
(纸本)9783642405648
In recent years, Answer Set programming (ASP), logicprogramming under the stable model or answer set semantics, has seen several extensions by generalizing the notion of an atom in these programs: be it aggregate atoms, HEX atoms, generalized quantifiers, or abstract constraints, the idea is to have more complicated satisfaction patterns in the lattice of Herbrand interpretations than traditional, simple atoms. In this paper we refer to any of these constructs as generalized atoms. It is known that programs with generalized atoms that have monotonic or antimonotonic satisfaction patterns do not increase complexity with respect to programs with simple atoms (if satisfaction of the generalized atoms can be decided in polynomial time) under most semantics. It is also known that generalized atoms that are nonmonotonic (being neither monotonic nor antimonotonic) can, but need not, increase the complexity by one level in the polynomial hierarchy if non-disjunctive programs under the FLP semantics are considered. In this paper we provide the precise boundary of this complexity gap: programs with convex generalized atom never increase complexity, while allowing a single non-convex generalized atom (under reasonable conditions) always does. We also discuss several implications of this result in practice.
Maher (2012) introduced an approach for relative expressiveness of defeasible logics, and two notions of relative expressiveness were investigated. Using the first of these definitions of relative expressiveness, we s...
详细信息
Maher (2012) introduced an approach for relative expressiveness of defeasible logics, and two notions of relative expressiveness were investigated. Using the first of these definitions of relative expressiveness, we show that all the defeasible logics in the DL framework are equally expressive under this formulation of relative expressiveness. the second formulation of relative expressiveness is stronger than the first. However, we show that logics incorporating individual defeat are equally expressive as the corresponding logics with team defeat. thus the only differences in expressiveness of logics in DL arise from differences in how ambiguity is handled. this completes the study of relative expressiveness in DL begun in Maher (2012).
In this paper, we describe our ongoing work on the application of the Aspect-Oriented programming paradigm to the problem of ontology modularization driven by overlapping modularization requirements. We examine common...
详细信息
In this paper, we describe our ongoing work on the application of the Aspect-Oriented programming paradigm to the problem of ontology modularization driven by overlapping modularization requirements. We examine commonalities between ontology modules and software aspects and propose an approach to applying the latter to the problem of a priori construction of modular ontologies and a posteriori ontology modularization.
作者：
Benhamou, Belaïd
Domaine univ. S. Jerome Ave. Escadrille Normandie Niemen 13397 Marseille Cedex 20 France
Université d'Artois SP 18 Rue Jean Souvraz F 62307 Lens Cedex France
Many research works had been done in order to define a semantics for logic programs. the well know is the stable model semantics which selects for each program one of its canonical models. the stable models of a logic...
详细信息
In the field of non-monotoniclogics, the notion of rational closure is acknowledged as a landmark and we are going to see whether such a construction can be adopted in the context of mathematical fuzzy logic, a so fa...
详细信息
Publishing private data on external servers incurs the problem of how to avoid unwanted disclosure of confidential data. We study the problem of confidentiality-preservation when publishing extended disjunctive logic ...
详细信息
暂无评论