Turner's logic of universal causation is a general logic for nonmonotonic reasoning. It has its origin in McCain and Turner's causal action theories which have been translated to propositional logic and logic ...
详细信息
ISBN:
(纸本)9783642405648
Turner's logic of universal causation is a general logic for nonmonotonic reasoning. It has its origin in McCain and Turner's causal action theories which have been translated to propositional logic and logicprogramming with nested expressions. In this paper, we propose to do the same for Turner's logic, and show thatTurner's logic can actually be mapped to McCain and Turner's causal theories. these results can be used to construct a system for reasoning in Turner's logic.
It has been known for a long time that intuitionistically equivalent formulas have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions and disjunctions and show h...
详细信息
ISBN:
(纸本)9783642405648
It has been known for a long time that intuitionistically equivalent formulas have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions and disjunctions and show how to apply this generalization to proving properties of aggregates in answer set programming.
In this paper, we explore the use of Linear logicprogramming for story generation. We use the language Celf to represent narrative knowledge, and its own querying mechanism to generate story instances, through a numb...
详细信息
ISBN:
(纸本)9783642405648
In this paper, we explore the use of Linear logicprogramming for story generation. We use the language Celf to represent narrative knowledge, and its own querying mechanism to generate story instances, through a number of proof terms. Each proof term obtained is used, through a resource-flow analysis, to build a directed graph where nodes are narrative actions and edges represent inferred causality relationships. Such graphs represent narrative plots structured by narrative causality. this approach is a candidate technique for narrative generation which unifies declarative representations and generation via query and deduction mechanisms.
Matchmaking is a form of scheduling that aims at bringing companies or people together that share common interests, services, or products in order to facilitate future business partnerships. We begin by furnishing a f...
详细信息
ISBN:
(纸本)9783642405648
Matchmaking is a form of scheduling that aims at bringing companies or people together that share common interests, services, or products in order to facilitate future business partnerships. We begin by furnishing a formal characterization of the corresponding multi-criteria optimization problem. We then address this problem by Answer Set programming in order to solve real-world matchmaking instances, which were previously dealt with by special-purpose algorithms.
We pinpoint the limitations of existing approaches to the treatment of strong and default negation in answer-set program updates and formulate the early recovery principle that plausibly constrains their interaction.
ISBN:
(纸本)9783642405648
We pinpoint the limitations of existing approaches to the treatment of strong and default negation in answer-set program updates and formulate the early recovery principle that plausibly constrains their interaction.
In this paper we introduce a logicprogramming based framework which allows the representation of conditional non-monotonic temporal beliefs and goals in a declarative way. We endow it with stable model like semantics...
详细信息
ISBN:
(纸本)9783642405648
In this paper we introduce a logicprogramming based framework which allows the representation of conditional non-monotonic temporal beliefs and goals in a declarative way. We endow it with stable model like semantics that allows us to deal with conflicting goals and generate possible alternatives. We show that our framework satisfies some usual properties on goals and that it allows imposing alternative constraints on the interaction between beliefs and goals. We prove the decidability of the usual reasoning tasks and show how they can be implemented using an ASP solver and an LTL reasoner in a modular way, thus taking advantage of existing LTL reasoners and ASP solvers.
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.
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 with non-monotonic operators. In this way we provide the first (to our knowledge) general semantic framework for capturing the semantics of non-monotonic intensional logicprogramming.
Answering realistic questions about biological systems and pathways similar to text book questions used for testing students' understanding of such systems is one of our long term research goals. Often these quest...
详细信息
ISBN:
(纸本)9783642405648
Answering realistic questions about biological systems and pathways similar to text book questions used for testing students' understanding of such systems is one of our long term research goals. Often these questions require simulation based reasoning. In this paper, we show how higher level extensions of Petri Nets, such as colored tokens can be encoded in Answer Set programming, thereby providing the right formalisms to model and reason about such questions with relative ease. Our approach can be adapted to other domains.
this paper presents a sequential model of bargaining based on abductive reasoning in ASP. We assume that each agent is represented by a logic program that encodes the background knowledge of the agent. Each agent has ...
详细信息
ISBN:
(纸本)9783642405648
this paper presents a sequential model of bargaining based on abductive reasoning in ASP. We assume that each agent is represented by a logic program that encodes the background knowledge of the agent. Each agent has a set of goals to achieve but these goals are normally unachievable without an agreement from the other agent. We design an alternating-offers procedure that shows how an agreement between two agents can be reached through a reasoning process based on answer set programming and abduction. We prove that the procedure converges to a Nash equilibrium if each player makes rational offer/counter-offer at each round.
暂无评论