ORCID Profile
0000-0002-9878-2762
Current Organisation
Independent Reseacher
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
In Research Link Australia (RLA), "Research Topics" refer to ANZSRC FOR and SEO codes. These topics are either sourced from ANZSRC FOR and SEO codes listed in researchers' related grants or generated by a large language model (LLM) based on their publications.
Logics And Meanings Of Programs | Interorganisational Information Systems | Other Artificial Intelligence | Information Systems | Conceptual Modelling | Cognitive Science | Knowledge Representation And Machine Learning |
Computer software and services not elsewhere classified | Other
Publisher: Springer International Publishing
Date: 2018
Publisher: Springer Science and Business Media LLC
Date: 08-2005
Publisher: Springer London
Date: 1996
Publisher: ACM
Date: 06-06-2011
Publisher: Springer Science and Business Media LLC
Date: 21-01-2023
Publisher: ACM
Date: 05-2001
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Springer Berlin Heidelberg
Date: 2006
Publisher: Springer International Publishing
Date: 2016
Publisher: Springer Science and Business Media LLC
Date: 23-02-2018
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany
Date: 2013
Publisher: IEEE
Date: 10-2017
DOI: 10.1109/EDOC.2017.21
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: Springer Berlin Heidelberg
Date: 1999
Publisher: Springer Berlin Heidelberg
Date: 2013
Publisher: Springer Berlin Heidelberg
Date: 2002
Publisher: Association for Computing Machinery (ACM)
Date: 04-2001
Abstract: The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context of Defeasible Logic, a simple but efficient formalism for nonmonotonic reasoning based on rules and priorities. The transformations described in this paper have two main benefits: on one hand they can be used as a theoretical tool that leads to a deeper understanding of the formalism, and on the other hand they have been used in the development of an efficient implementation of defeasible logic.
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11941439_85
Publisher: ACM
Date: 06-06-2011
Publisher: Springer Science and Business Media LLC
Date: 03-2004
Publisher: Association for Computing Machinery (ACM)
Date: 10-2010
Abstract: Defeasible reasoning is a computationally simple nonmonotonic reasoning approach that has attracted significant theoretical and practical attention. It comprises a family of logics that capture different intuitions, among them ambiguity propagation versus ambiguity blocking, and the adoption or rejection of team defeat. This article provides a compact presentation of the defeasible logic variants, and derives an inclusion theorem which shows that different notions of provability in defeasible logic form a chain of levels of proof.
Publisher: IEEE
Date: 2005
DOI: 10.1109/EEE.2005.61
Publisher: Oxford University Press (OUP)
Date: 18-01-2014
Publisher: IEEE Comput. Soc
Date: 2002
Publisher: Elsevier BV
Date: 12-2011
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: ACM
Date: 10-06-2013
Publisher: IGI Global
Date: 2011
Abstract: Defeasible logic is a non-monotonic formalism that deals with incomplete and conflicting information, whereas modal logic deals with the concepts of necessity and possibility. These types of logics play a significant role in the emerging Semantic Web, which enriches the available Web information with meaning, leading to better cooperation between end-users and applications. Defeasible and modal logics, in general, and, particularly, deontic logic provide means for modeling agent communities, where each agent is characterized by its cognitive profile and normative system, as well as policies, which define privacy requirements, access permissions, and in idual rights. Toward this direction, this article discusses the extension of DR-DEVICE, a Semantic Web-aware defeasible reasoner, with a mechanism for expressing modal logic operators, while testing the implementation via deontic logic operators, concerned with obligations, permissions, and related concepts. The motivation behind this work is to develop a practical defeasible reasoner for the Semantic Web that takes advantage of the expressive power offered by modal logics, accompanied by the flexibility to define erse agent behaviours. A further incentive is to study the various motivational notions of deontic logic and discuss the cognitive state of agents, as well as the interactions among them.
Publisher: Springer Berlin Heidelberg
Date: 2005
DOI: 10.1007/11581062_10
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: Elsevier BV
Date: 03-2008
Publisher: Springer Berlin Heidelberg
Date: 10-04-2014
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: ACM
Date: 08-06-2015
Publisher: IEEE
Date: 2005
DOI: 10.1109/EDOC.2005.13
Publisher: World Scientific Pub Co Pte Lt
Date: 06-2005
Publisher: Springer International Publishing
Date: 2022
Publisher: Springer International Publishing
Date: 2018
Publisher: Springer Berlin Heidelberg
Date: 2005
DOI: 10.1007/11589990_72
Publisher: Center for Open Science
Date: 29-08-2023
Abstract: We present a brief overview of the Domain Specific Language L4 and provide a defeasible semantics of it based on the Answer Set Programming encoding of Defeasible Deontic Logic.
Publisher: Springer Science and Business Media LLC
Date: 22-11-2014
Publisher: Springer Science and Business Media LLC
Date: 05-03-2018
Publisher: Springer Science and Business Media LLC
Date: 03-2019
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: IEEE
Date: 2006
DOI: 10.1109/DASC.2006.19
Publisher: Springer International Publishing
Date: 2018
Publisher: Elsevier BV
Date: 07-2022
Publisher: Springer Berlin Heidelberg
Date: 2000
Publisher: Springer International Publishing
Date: 2014
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: Oxford University Press (OUP)
Date: 24-12-2009
Publisher: Springer International Publishing
Date: 2014
Publisher: Walter de Gruyter GmbH
Date: 12-2013
Abstract: In this paper we propose an abstract framework to model the deontic notions relevant for business process compliance. In particular, we provide a comprehensive classification of the obligation types relevant for modelling whether a process is compliant, and we describe their semantics in terms of execution traces.
Publisher: IEEE
Date: 12-2008
Publisher: Springer Science and Business Media LLC
Date: 15-02-2008
Publisher: IEEE
Date: 2009
Publisher: No publisher found
Date: 2023
Publisher: ACM
Date: 04-06-2007
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: Springer Netherlands
Date: 2007
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Springer Science and Business Media LLC
Date: 10-01-2019
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: Oxford University Press (OUP)
Date: 10-2004
Publisher: Springer International Publishing
Date: 2018
Publisher: Elsevier BV
Date: 2019
Publisher: Elsevier BV
Date: 06-2002
Publisher: Springer Berlin Heidelberg
Date: 2003
Publisher: Springer Science and Business Media LLC
Date: 24-02-2018
Publisher: Elsevier BV
Date: 07-2021
Publisher: IEEE
Date: 12-2008
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: ACM
Date: 04-06-2007
Publisher: Springer International Publishing
Date: 2015
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Springer Berlin Heidelberg
Date: 1996
Publisher: Springer Netherlands
Date: 2000
Publisher: Springer Berlin Heidelberg
Date: 2006
Publisher: IEEE
Date: 09-2015
Publisher: Elsevier BV
Date: 10-2023
Publisher: Springer Berlin Heidelberg
Date: 2006
Publisher: Informa UK Limited
Date: 07-2008
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: Springer Science and Business Media LLC
Date: 23-05-2009
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: Springer Science and Business Media LLC
Date: 24-05-2016
Publisher: Springer Science and Business Media LLC
Date: 20-09-2018
Publisher: Springer Berlin Heidelberg
Date: 2003
Publisher: Oxford University Press (OUP)
Date: 03-2012
Publisher: IEEE
Date: 02-2019
Publisher: IEEE
Date: 06-2010
Publisher: Springer International Publishing
Date: 2014
Publisher: Springer International Publishing
Date: 2014
Publisher: IEEE
Date: 10-2006
DOI: 10.1109/EDOC.2006.22
Publisher: ACM
Date: 06-06-2005
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2010
Publisher: IGI Global
Date: 2013
DOI: 10.4018/978-1-4666-3610-1.CH007
Abstract: Defeasible logic is a non-monotonic formalism that deals with incomplete and conflicting information, whereas modal logic deals with the concepts of necessity and possibility. These types of logics play a significant role in the emerging Semantic Web, which enriches the available Web information with meaning, leading to better cooperation between end-users and applications. Defeasible and modal logics, in general, and, particularly, deontic logic provide means for modeling agent communities, where each agent is characterized by its cognitive profile and normative system, as well as policies, which define privacy requirements, access permissions, and in idual rights. Toward this direction, this article discusses the extension of DR-DEVICE, a Semantic Web-aware defeasible reasoner, with a mechanism for expressing modal logic operators, while testing the implementation via deontic logic operators, concerned with obligations, permissions, and related concepts. The motivation behind this work is to develop a practical defeasible reasoner for the Semantic Web that takes advantage of the expressive power offered by modal logics, accompanied by the flexibility to define erse agent behaviours. A further incentive is to study the various motivational notions of deontic logic and discuss the cognitive state of agents, as well as the interactions among them.
Publisher: IEEE
Date: 09-2015
Publisher: Springer International Publishing
Date: 2013
Publisher: Springer Berlin Heidelberg
Date: 2004
Publisher: Springer International Publishing
Date: 2019
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: Open Publishing Association
Date: 14-08-2019
DOI: 10.4204/EPTCS.298.1
Publisher: Cambridge University Press (CUP)
Date: 22-08-2017
DOI: 10.1017/S1471068417000266
Abstract: Defeasible logics provide several linguistic features to support the expression of defeasible knowledge. There is also a wide variety of such logics, expressing different intuitions about defeasible reasoning. However, the logics can only combine in trivial ways. This limits their usefulness in contexts where different intuitions are at play in different aspects of a problem. In particular, in some legal settings, different actors have different burdens of proof, which might be expressed as reasoning in different defeasible logics. In this paper, we introduce annotated defeasible logic as a flexible formalism permitting multiple forms of defeasibility, and establish some properties of the formalism.
Publisher: Springer Berlin Heidelberg
Date: 1996
Publisher: Cambridge University Press (CUP)
Date: 31-03-2016
DOI: 10.1017/S1471068416000053
Abstract: The paper proposes a fresh look at the concept of goal and advances that motivational attitudes like desire, goal and intention are just facets of the broader notion of (acceptable) outcome. We propose to encode the preferences of an agent as sequences of “alternative acceptable outcomes”. We then study how the agent's beliefs and norms can be used to filter the mental attitudes out of the sequences of alternative acceptable outcomes. Finally, we formalise such intuitions in a novel Modal Defeasible Logic and we prove that the resulting formalisation is computationally feasible.
Publisher: Springer Berlin Heidelberg
Date: 2007
Publisher: Springer Berlin Heidelberg
Date: 2013
Publisher: Springer International Publishing
Date: 2019
Publisher: Center for Open Science
Date: 14-06-2023
Abstract: We present a defeasible semantics for the CCLAW L4 Domanin Specific Language for legal reasoning using an Answer Set Programming implementation of Defasible Deontic Logic
Publisher: IEEE
Date: 12-2008
Publisher: Inderscience Publishers
Date: 2009
Publisher: Springer Science and Business Media LLC
Date: 2005
Publisher: Springer Science and Business Media LLC
Date: 17-09-2013
Publisher: Springer International Publishing
Date: 2021
Publisher: Springer Science and Business Media LLC
Date: 20-03-2018
Publisher: Springer International Publishing
Date: 2014
Publisher: Springer International Publishing
Date: 2018
Publisher: Springer Nature Switzerland
Date: 2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Springer International Publishing
Date: 2015
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2018
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: Springer Berlin Heidelberg
Date: 2004
Publisher: IEEE
Date: 10-2020
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: ACM
Date: 25-07-2005
Publisher: Springer Berlin Heidelberg
Publisher: Springer Berlin Heidelberg
Date: 1996
Publisher: Springer International Publishing
Date: 2018
Publisher: Springer Berlin Heidelberg
Date: 2001
Publisher: Springer Science and Business Media LLC
Date: 03-06-2023
DOI: 10.1007/S10506-023-09350-1
Abstract: This article proposes an innovative methodology for enhancing the technical validation, legal alignment and interdisciplinarity of attempts to encode legislation. In the context of an experiment that examines how different legally trained participants convert select provisions of the Australian Copyright Act 1968 (Cth) into machine-executable code, we find that a combination of manual and automated methods for coding validation, which focus on formal adherence to programming languages and conventions, can significantly increase the similarity of encoded rules between coders. Participants nonetheless encountered various interpretive difficulties, including syntactic ambiguity, and intra- and intertextuality, which necessitated legal evaluation, as distinct from and in addition to coding validation. Many of these difficulties can be resolved through what we call a process of ‘legal alignment’ that aims to enhance the congruence between encoded provisions and the true meaning of a statute as determined by the courts. However, some difficulties cannot be overcome in advance, such as factual indeterminacy. Given the inherently interdisciplinary nature of encoding legislation, we argue that it is desirable for ‘rules as code’ (‘RaC’) initiatives to have, at a minimum, legal subject matter, statutory interpretation and technical programming expertise. Overall, we contend that technical validation, legal alignment and interdisciplinary teamwork are integral to the success of attempts to encode legislation. While legal alignment processes will vary depending on jurisdictionally-specific principles and practices of statutory interpretation, the technical and interdisciplinary components of our methodology are transferable across regulatory contexts, bodies of law and Commonwealth and other jurisdictions.
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: Elsevier BV
Date: 04-2003
Publisher: Springer Science and Business Media LLC
Date: 04-03-2016
Publisher: IGI Global
Date: 2009
DOI: 10.4018/978-1-60566-288-6.CH020
Abstract: It is a typical scenario that many organisations have their business processes specified independently of their business obligations (which includes contractual obligations to business partners, as well as obligations a business has to fulfil against regulations and industry standards). This is because of the lack of guidelines and tools that facilitate derivation of processes from contracts but also because of the traditional mindset of treating contracts separately from business processes. This chapter will provide a solution to one specific problem that arises from this situation, namely the lack of mechanisms to check whether business processes are compliant with business contracts. The chapter begins by defining the space for business process compliance and the eco-system for ensuring that process are compliant. The key point is that compliance is a relationship between two sets of specifications: the specifications for executing a business process and the specifications regulating a business. The central part of the chapter focuses on a logic based formalism for describing both the semantics of normative specifications and the semantics of compliance checking procedures.
Publisher: Springer International Publishing
Date: 2018
Publisher: Association for Computing Machinery (ACM)
Date: 26-02-2018
DOI: 10.1145/3183367
Abstract: Blockchain technology offers a sizable promise to rethink the way interorganizational business processes are managed because of its potential to realize execution without a central party serving as a single point of trust (and failure). To stimulate research on this promise and the limits thereof, in this article, we outline the challenges and opportunities of blockchain for business process management (BPM). We first reflect how blockchains could be used in the context of the established BPM lifecycle and second how they might become relevant beyond. We conclude our discourse with a summary of seven research directions for investigating the application of blockchain technology in the context of BPM.
Publisher: IEEE
Date: 12-2010
Publisher: ACM
Date: 07-05-2002
Publisher: Springer Berlin Heidelberg
Date: 2007
Publisher: Springer Berlin Heidelberg
Publisher: Springer Berlin Heidelberg
Publisher: Springer Berlin Heidelberg
Date: 2004
Publisher: ACM
Date: 16-03-2008
Publisher: Springer International Publishing
Date: 2016
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: Elsevier BV
Date: 03-2009
Publisher: Scalable Computing: Practice and Experience
Date: 30-01-2016
Publisher: Springer Berlin Heidelberg
Date: 2002
Publisher: Springer Berlin Heidelberg
Date: 2007
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2015
Publisher: Springer International Publishing
Date: 2015
Publisher: IEEE
Date: 12-2011
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: Walter de Gruyter GmbH
Date: 12-2013
Abstract: In this paper we propose an abstract framework to model the deontic notions relevant for business process compliance. In particular, we provide a comprehensive classification of the obligation types relevant for modelling whether a process is compliant, and we describe their semantics in terms of execution traces.
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: Springer Berlin Heidelberg
Publisher: Springer International Publishing
Date: 31-05-2018
Publisher: Springer Berlin Heidelberg
Date: 1995
Publisher: Springer Science and Business Media LLC
Date: 02-02-2008
Publisher: Springer Science and Business Media LLC
Date: 03-2008
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: ACM
Date: 14-05-2007
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: IEEE
Date: 09-2013
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: Springer Berlin Heidelberg
Date: 1999
Publisher: Springer Berlin Heidelberg
Date: 1999
Publisher: Springer Berlin Heidelberg
Date: 2005
DOI: 10.1007/11591191_43
Publisher: World Scientific Pub Co Pte Lt
Date: 12-2006
DOI: 10.1142/S0218843006001529
Abstract: This paper presents a formal system for reasoning about violations of obligations in contracts. The system is based on the formalism for the representation of contrary-to-duty obligations. These are the obligations that take place when other obligations are violated as typically applied to penalties in contracts. The paper shows how this formalism can be mapped onto the key policy concepts of a contract specification language, called Business Contract Language (BCL), previously developed to express contract conditions for run time contract monitoring. The aim of this mapping is to establish a formal underpinning for this key subset of BCL.
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Informa UK Limited
Date: 09-10-2008
Publisher: Springer International Publishing
Date: 2015
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Informa UK Limited
Date: 13-12-2011
Publisher: Springer Berlin Heidelberg
Date: 1997
Publisher: Oxford University Press (OUP)
Date: 12-2002
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11961536_8
Publisher: Springer International Publishing
Date: 2021
DOI: 10.1007/978-3-030-79876-5_32
Abstract: We introduce a modular and transparent approach for augmenting the ability of reinforcement learning agents to comply with a given norm base. The normative supervisor module functions as both an event recorder and real-time compliance checker w.r.t. an external norm base. We have implemented this module with a theorem prover for defeasible deontic logic, in a reinforcement learning agent that we task with playing a “vegan” version of the arcade game Pac-Man.
Publisher: Springer Berlin Heidelberg
Date: 2013
Publisher: Springer International Publishing
Date: 2018
Publisher: Elsevier BV
Date: 12-2011
Publisher: Elsevier BV
Date: 12-2011
Publisher: ACM
Date: 17-06-2019
Publisher: Springer International Publishing
Date: 2014
Publisher: Springer Berlin Heidelberg
Date: 2013
Publisher: IEEE
Date: 09-2010
Publisher: Elsevier BV
Date: 07-2009
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: Springer Berlin Heidelberg
Date: 2013
Publisher: ACM
Date: 19-06-2023
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: Springer Berlin Heidelberg
Date: 2000
DOI: 10.1007/10722086_10
Publisher: Springer Berlin Heidelberg
Date: 2013
Publisher: World Scientific Pub Co Pte Lt
Date: 06-2005
DOI: 10.1142/S0218843005001092
Abstract: This paper presents an approach for the specification and implementation of translating contracts from a human-oriented form into an executable representation for monitoring. This will be done in the setting of RuleML. The task of monitoring contract execution and performance requires a logical account of deontic and defeasible aspects of legal language currently such aspects are not covered by RuleML accordingly we show how to extend it to cover such notions. From its logical form, the contract will thus be transformed into a machine readable rule notation and eventually implemented as executable semantics via any mark-up languages depending on the client's preference, for contract monitoring purposes.
Publisher: IEEE
Date: 09-2009
DOI: 10.1109/EDOC.2009.19
Publisher: Springer International Publishing
Date: 2017
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11941439_15
Publisher: Elsevier BV
Date: 07-2012
DOI: 10.1016/J.ARTMED.2012.03.002
Abstract: Temporal information plays a crucial role in medicine, so that in medical informatics there is an increasing awareness that suitable database approaches are needed to store and support it. Specifically, a great amount of clinical data (e.g., therapeutic data) are periodically repeated. Although an explicit treatment is possible in most cases, it causes severe storage and disk I/O problems. In this paper, we propose an innovative approach to cope with periodic relational medical data in an implicit way. We propose a new data model, representing periodic data in a compact (implicit) way, which is a consistent extension of TSQL2 consensus approach. Then, we identify some important types of temporal queries, and present query answering algorithms to answer them. Finally, we also run experiments to evaluate our approach. The experiments show that our approach outperforms current explicit approaches, especially as regard disk I/O. We have provided an implicit approach to periodic data with is a consistent extension of TSQL2 (and which is thus grant interoperable with it), and we have experimentally proven that it outperforms current explicit approaches.
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: Elsevier BV
Date: 11-2007
Publisher: IEEE
Date: 03-2013
DOI: 10.1109/ICSTW.2013.6
Publisher: Cambridge University Press (CUP)
Date: 16-10-2006
Publisher: Springer International Publishing
Date: 2022
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany
Date: 2013
Publisher: Springer Berlin Heidelberg
Date: 2005
DOI: 10.1007/11580072_12
Publisher: Springer Science and Business Media LLC
Date: 29-12-2017
Publisher: Springer Berlin Heidelberg
Date: 2005
DOI: 10.1007/11580072_18
Publisher: Springer International Publishing
Date: 2016
Publisher: ACM Press
Date: 2003
Publisher: Oxford University Press (OUP)
Date: 29-04-2009
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany
Date: 2012
Publisher: Springer International Publishing
Date: 2015
Start Date: 2004
End Date: 12-2010
Amount: $480,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2005
End Date: 12-2007
Amount: $262,000.00
Funder: Australian Research Council
View Funded Activity