Filters








7,560 Hits in 7.6 sec

Using Causal Relationships to Deal with the Ramification Problem in Action Formalisms Based on Description Logics [chapter]

Franz Baader, Marcel Lippmann, Hongkai Liu
2010 Lecture Notes in Computer Science  
In this paper, we show that causal relationships can be added to action formalisms based on Description Logics (DLs) without destroying the decidability of the consistency and the projection problem.  ...  In the reasoning about actions community, causal relationships have been proposed as a possible approach for solving the ramification problem, i.e., the problem of how to deal with indirect effects of  ...  First, the formalism in [9] requires the user to deal with the ramification problem within every action description.  ... 
doi:10.1007/978-3-642-16242-8_7 fatcat:weftkcohu5hqxpfuugur4fh4ji

WSSL: A Fluent Calculus-Based Language for Web Service Specifications [chapter]

George Baryannis, Dimitris Plexousakis
2013 Lecture Notes in Computer Science  
These issues involve the frame, ramification and qualification problems, which deal with the succinct and flexible representation of non-effects, indirect effects and preconditions, respectively.  ...  We propose WSSL, a novel specification language for services, based on the fluent calculus, that is expressly designed to address the aforementioned issues.  ...  This research was partially funded by the PaaSage (FP7-317715) EU project, as well as the Special Account for Research Grants, University of Crete (Grant No. 3742).  ... 
doi:10.1007/978-3-642-38709-8_17 fatcat:yoyr6hwp2fgutg22wumpbeitx4

Ramifications: An Extension and Correspondence Result for the Event Calculus

J. Forth, R. Miller
2007 Journal of Logic and Computation  
The first, EC-R, is a narrative-based action formalism able to represent concurrent events, non-deterministic actions and indirect causal effects by virtue of an integrated solution to the frame and ramification  ...  Classical logic Event Calculus, and the special purpose logical action language E, are both well established formalisms for describing actions and change.  ...  Acknowledgements We would like to thank Murray Shanahan for many useful discussions, Ian Hodkinson for help with the appendix, and also thank the anonymous reviewers for thoughtful and thoughtprovoking  ... 
doi:10.1093/logcom/exm018 fatcat:bdygpjq3zrg67fiayejbebomdq

Ramification and causality in a modal action logic

L Giordano
2000 Journal of Logic and Computation  
The problem of ramification is tackled by introducing a modal causality operator which is used to represent causal rules.  ...  The paper presents a logic for action theory based on a modal language, where modalities represent actions.  ...  Acknowledgement We are grateful to the referees for their careful checking of the work and for their helpful comments.  ... 
doi:10.1093/logcom/10.5.625 fatcat:y77butmw5feotka4yy5llxewg4

Qualified Ramifications [chapter]

2000 Lecture Notes in Computer Science  
Taking a recent causality-based solution to the plain Ramification Problem as starting point, we develop an action theory that is shown to successfully address this amalgamation of Ramification and Qualification  ...  We consider the problem of ramifications, i.e., indirect effects of actions, having exceptions. It is argued that straightforward minimization of abnormality is insufficient in this context.  ...  The work reported here essentially relies on our causality-based solution to the Ramification Problem described in (Thielscher 1997) .  ... 
doi:10.1007/3-540-45596-5_4 fatcat:r3nz3slsqbg4bj2j3beok5qmna

Page 4960 of Mathematical Reviews Vol. , Issue 99g [page]

1999 Mathematical Reviews  
Thus, our KARO-framework tries to deal formally with the notion of knowledge possessed by the agents, and with their possible execution of actions.  ...  As a solution, we adapt from a recent causality-based solution to the qualification problem the key principle of initial minimization.  ... 

A Solution to the Ramification Problem Expressed in Temporal Description Logics

Nikos Papadakis, Polydoros Petrakis, Dimitris Plexousakis, Charalampos Manifavas
2014 International Journal of Semantic Computing (IJSC)  
We describe a thorough solution to the ramification problem in Temporal Settings expressed in Temporal Description Logics.  ...  It has been shown in previous work that the ramification problem can be solved with the use of integrity constraints and actions representation.  ...  in the following example of Section 3. 3 Dealing with the ramification problem with algorithms expressed in Temporal Description Logics A solution to the ramification problem with the use of Temporal  ... 
doi:10.1142/s1793351x14500019 fatcat:e27izr4spngwpckg4zykvxxqlq

ASP for Reasoning about Actions with an EL^bot Knowledge Base

Laura Giordano, Alberto Martelli, Matteo Spiotta, Daniele Theseider Dupré
2016 Italian Conference on Computational Logic  
The action language allows for non-deterministic actions, and causal rules are introduced to deal with ramifications.  ...  In this paper we propose an approach based on Answer Set Programming (ASP) for reasoning about actions in a domain description including knowledge expressed in the low complexity description logic EL ⊥  ...  [4] which uses causal relationships to deal with the ramification problem in an action formalism based on description logics.  ... 
dblp:conf/cilc/0001MSD16 fatcat:7ioiv3eohfcxveys4ibiqvtnd4

Reasoning About Actions with EL(bot) Ontologies and Temporal Answer Sets

Laura Giordano, Alberto Martelli, Daniele Theseider Dupré
2021 International Conference on Logic Programming  
We propose an approach based on Answer Set Programming for reasoning about actions with domain descriptions including ontological knowledge, expressed in the lightweight description logic ℰℒ ⊥ .  ...  We consider a temporal action theory, which allows for non-deterministic actions and causal rules to deal with ramifications, and whose extensions are defined by temporal answer sets.  ...  [4] uses causal relationships to deal with the ramification problem in an action formalism based on description logics, and it exploits a semantics of actions and causal laws in the style of Winslett's  ... 
dblp:conf/iclp/0001MD21 fatcat:rcuhjs5euzhmdgftuhyigt24r4

Reasoning about actions with EL ontologies with temporal answer sets [article]

Laura Giordano, Alberto Martelli, Daniele Theseider Dupré
2021 arXiv   pre-print
We propose an approach based on Answer Set Programming for reasoning about actions with domain descriptions including ontological knowledge, expressed in the lightweight description logic EL^\bot.  ...  We consider a temporal action theory, which allows for non-deterministic actions and causal rules to deal with ramifications, and whose extensions are defined by temporal answer sets.  ...  [4] uses causal relationships to deal with the ramification problem in an action formalism based on description logics, and it exploits a semantics of actions and causal laws in the style of Winslett's  ... 
arXiv:2107.08403v1 fatcat:celyzwmhdjawlmt6r5dsyifx7i

A general first-order solution to the ramification problem with cycles

Hannes Strass, Michael Thielscher
2013 Journal of Applied Logic  
We provide a solution to the ramification problem that integrates findings of different axiomatic approaches to ramification from the last ten to fifteen years.  ...  We finally prove the resulting effect axioms sound and complete with respect to the semantics defined earlier.  ...  The authors are grateful to Fangzhen Lin and several anonymous reviewers for constructive criticisms on earlier versions of this paper.  ... 
doi:10.1016/j.jal.2013.05.003 fatcat:4bw4fbnhqnbbhkdh7zbvfwy7sm

Fluent Calculus-Based Semantic Web Service Composition and Verification Using WSSL [chapter]

George Baryannis, Dimitris Plexousakis
2014 Lecture Notes in Computer Science  
the frame, ramification and qualification problems.  ...  We propose a composition and verification framework for Semantic Web Services specified using WSSL, a novel service specification language based on the fluent calculus, that addresses issues related to  ...  Apart from the frame problem, the fluent calculus offers a solution to the problem of representing ramifications as well, using causal relationships that link a ramification to the direct effect (or ramification  ... 
doi:10.1007/978-3-319-06859-6_23 fatcat:svt2tlbelfg5vnluvhmfamsgxy

Consistency of Action Descriptions [chapter]

Dongmo Zhang, Samir Chopra, Norman Y. Foo
2002 Lecture Notes in Computer Science  
A highly expressive form of action descriptions, the normal form, is introduced to facilitate this analysis.  ...  The relative satisfiability of the situation calculus is generalized to accommodate non-deterministic effects and ramifications.  ...  This provides us with a formal tool to detect incorrect or inadequate action descriptions. Example 4.  ... 
doi:10.1007/3-540-45683-x_10 fatcat:eg3uow7spbhzhndkkqlakgiquu

DL Actions with GCIs: a Pragmatic Approach

Hongkai Liu, Carsten Lutz, Maja Milicic, Frank Wolter
2006 International Workshop on Description Logics  
We recently proposed action formalisms based on description logics (DLs) as decidable fragments of well-established action theories such as the Situation Calculus and the Fluent Calculus.  ...  In this paper, we define DL action formalisms that admit GCIs, propose a pragmatic approach to addressing the ramification problem that is introduced in this way, show that our formalim is decidable and  ...  We would like to thank Giuseppe De Giacomo for ideas and discussions. The third author is supported by the DFG Graduiertenkolleg 334. The fourth author is partially supported by UK EPSRC grant no.  ... 
dblp:conf/dlog/LiuLMW06 fatcat:qhf7nuk66jad7m3hu6dirlva3a

Modular-E and the role of elaboration tolerance in solving the qualification problem

Antonis Kakas, Loizos Michael, Rob Miller
2011 Artificial Intelligence  
More precisely, we describe how ME is able to use straightforward default reasoning techniques to solve the exogenous qualification problem largely because its robust treatments of the frame, ramification  ...  ME is able to represent non-deterministic domains involving concurrency, static laws (constraints), indirect effects (ramifications), and narrative information in the form of action occurrences and observations  ...  Acknowledgements Many thanks to the anonymous reviewers for giving the originally submitted version of this paper such a careful and detailed reading, and for the many helpful and insightful suggestions  ... 
doi:10.1016/j.artint.2010.04.008 fatcat:evw5efsgrnfvzjzsstv3ia762e
« Previous Showing results 1 — 15 out of 7,560 results