BCIT Citations Collection | BCIT Institutional Repository

BCIT Citations Collection

Pages

An action description language for iterated belief change
Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-07), Hyderabad, India, 2007. We are interested in the belief change that occurs due to a sequence of ontic actions and epistemic actions. In order to represent such problems, we extend an existing epistemic action language to allow erroneous initial beliefs. We define a non-Markovian semantics for our action language that explicitly respects the interaction between ontic actions and epistemic actions. Further, we illustrate how to solve epistemic projection problems in our new language by translating action descriptions into extended logic programs. We conclude with some remarks about a prototype implementation of our work., Conference paper, Published.
Adding modal operators to the action language A
Proceedings of the International Workshop on Non-Monotonic Reasoning (NMR-04) in Whistler, BC, 2004. The action language A is a simple high-level language for describing transition systems. In this paper, we extend the action language A by allowing a unary modal operator in the underlying propositional logic. The extended language requires very little new machinery, and it is suitable for describing transitions between Kripke structures. We consider some formal restrictions on action descriptions that preserve natural classes of Kripke structures, and we prove that the modal epistemic extension of A naturally subsumes related approaches to reasoning about knowledge. We conclude with some plans for future work. Introduction The action language A is a simple high-level language for reasoning about the effects of actions (Gelfond & Lifschitz 1993). The basic language is suitable only for simple action domains, but it has been extended several times to address a wide range of problems (Baral & Gelfond 1997; Baral, Gelfond, & Provetti 1997). In this paper, we suggest that it is possible to increase the representational power of A without changing the action language itself. Instead, we look at extending the underlying propositional logic by adding modal operators. We consider the expressive power of the modal extension, and compare the framework with related work on epistemic extensions of A., Conference paper, Published.
Arbitrary announcements in propositional belief revision
Proceedings of the International Workshop on Defeasible and Ampliative Reasoning (DARe-15) in Buenos Aires, Argentina, July 27, 2015. Public announcements cause each agent in a group to modify their beliefs to incorporate some new piece of information, while simultaneously being aware that all other agents are doing the same. Given some fixed goal formula, it is natural to ask if there exists an announcement that will make the formula true in a multi-agent context. This problem is known to be undecidable in a general modal setting, where the presence of nested beliefs can lead to complex dynamics. In this paper, we consider not necessarily truthful public announcements in the setting of propositional belief revision. We are given a goal formula for each agent, and we are interested in finding a single announcement that will make each agent believe the corresponding goal following AGM-style belief revision. If the goals are inconsistent, then this can be seen as a form of ampliative reasoning. We prove that determining if there is an arbitrary public announcement in this setting is not only decidable, but that it is simpler than the corresponding problem in the most simplified modal logics. Moreover, we argue that propositional announcements and beliefs are sufficient for modelling many practical problems, including simple robot controllers., Conference paper, Published.
Assessment of building retrofit options using hygrothermal analysis tool
Proceedings of 7th Symposium on Building Physics in the Nordic Countries: 13 June 2005, Reykjavik, Iceland. As the stock of buildings in our society ages, it is expected that there will be an increase in building envelope rehabilitation work. Such activities represent an ideal opportunity to modify the existing wall system to improve building envelope durability and energy efficiency. This could be done by addition of insulation and sealing air leakage paths. However, there is very little information available on how to assess the moisture and energy (i.e. thermal) performance of retrofitted building envelope assemblies and select the optimum retrofit options that will maximize the long-term moisture performance and the energy efficiency of the retrofitted building envelopes together. This paper presents the findings from a study that has used a two-dimensional hygrothermal simulation tool, hygIRC-2D, to assess moisture and energy performance of retrofitted masonry walls used in high-rise construction for both residential and commercial types of buildings at various Canadian locations. The results from the simulations indicate that, if heat, air and moisture transport properties of the materials and the airflow characteristics of the systems can be defined properly a hygrothermal simulation tool can be used to evaluate the moisture and thermal (i.e. energy) performance of various wall systems and associated retrofit options., Published. A version of this document is published in: 7th Symposium on Building Physics in the Nordic Countries, Reykjavik, Iceland, June 13-15, 2005, pp. 1139-1146.
Belief change and cryptographic protocol verification
Proceedings of the 22nd Conference on Artificial Intelligence (AAAI-07) in Vancouver, BC, July 22–26, 2007. Cryptographic protocols are structured sequences of messages that are used for exchanging information in a hostile environment. Many protocols have epistemic goals: a successful run of the protocol is intended to cause a participant to hold certain beliefs. As such, epistemic logics have been employed for the verification of cryptographic protocols. Although this approach to verification is explicitly concerned with changing beliefs, formal belief change operators have not been incorporated in previous work. In this paper, we introduce a new approach to protocol verification by combining a monotonic logic with a non-monotonic belief change operator. In this context, a protocol participant is able to retract beliefs in response to new information and a protocol participant is able to postulate the most plausible event explaining new information. We illustrate that this kind of reasoning is particularly important when protocol participants have incorrect beliefs., Conference paper, Published.
Belief change in the context of fallible actions and observations
Proceedings of the 21st Conference on Artificial Intelligence (AAAI-06). Boston, MA, July 16–20, 2006. We consider the iterated belief change that occurs following an alternating sequence of actions and observations. At each instant, an agent has some beliefs about the action that occurs as well as beliefs about the resulting state of the world. We represent such problems by a sequence of ranking functions, so an agent assigns a quantitative plausibility value to every action and every state at each point in time. The resulting formalism is able to represent fallible knowledge, erroneous perception, exogenous actions, and failed actions. We illustrate that our framework is a generalization of several existing approaches to belief change, and it appropriately captures the non-elementary interaction between belief update and belief revision., Conference paper, Published.
Belief manipulation through propositional announcements
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (IJCAI-17) in Melbourne, Australia 19-25 August 2017. Public announcements cause each agent in a group to modify their beliefs to incorporate some new piece of information, while simultaneously being aware that all other agents are doing the same. Given a set of agents and a set of epistemic goals, it is natural to ask if there is a single announcement that will make each agent believe the corresponding goal. This problem is known to be undecidable in a general modal setting, where the presence of nested beliefs can lead to complex dynamics. In this paper, we consider not necessarily truthful public announcements in the setting of AGM belief revision. We prove that announcement finding in this setting is not only decidable, but that it is simpler than the corresponding problem in the most simplified modal logics. We then describe an implemented tool that uses announcement finding to control robot behaviour through belief manipulation., Conference paper, Published.
Belief modeling for maritime surveillance
Proceedings of 12th International Conference on Information Fusion, 2009, FUSION '09 in Seattle, WA, USA, 6-9 July 2009. In maritime surveillance, the volume of information to be processed is very large and there is a great deal of uncertainty about the data. There are many vessels at sea at every point in time, and the vast majority of them pose no threat to security. Sifting through all of the benign activity to find unusual activities is a difficult problem. The problem is made even more difficult by the fact that the available data about vessel activities is both incomplete and inconsistent. In order to manage this uncertainty, automated anomaly detection software can be very useful in the early detection of threats to security. This paper introduces a high-level architecture for an anomaly detection system based on a formal model of beliefs with respect to each entity in some domain of interest. In this framework, the system has beliefs about the intentions of each vessel in the maritime domain. If the vessel behaves in an unexpected manner, these intentions are revised and a human operations centre worker is notified. This approach is flexible, scalable, and easily manages inconsistent information. Moreover, the approach has the pragmatic advantage that it uses expert information to inform decision making, but the required information is easily obtained through simple ranking exercises., Conference paper, Published.
Belief revision and trust
Proceedings of the 15th International Workshop on Non-Monotonic Reasoning (NMR 2014), Vienna, Austria, 17–19 July 2014. Belief revision is the process in which an agent incorporates a new piece of information together with a pre-existing set of beliefs. When the new information comes in the form of a report from another agent, then it is clear that we must first determine whether or not that agent should be trusted. In this paper, we provide a formal approach to modeling trust as a pre-processing step before belief revision. We emphasize that trust is not simply a relation between agents; the trust that one agent has in another is often restricted to a particular domain of expertise. We demonstrate that this form of trust can be captured by associating a state-partition with each agent, then relativizing all reports to this state partition before performing belief revision. In this manner, we incorporate only the part of a report that falls under the perceived domain of expertise of the reporting agent. Unfortunately, state partitions based on expertise do not allow us to compare the relative strength of trust held with respect to different agents. To address this problem, we introduce pseudometrics over states to represent differing degrees of trust. This allows us to incorporate simultaneous reports from multiple agents in a way that ensures the most trusted reports will be believed., Conference paper, Published.
Belief revision on modal accessibility relations
Proceedings of the 6th International Conference on Agents and Artificial Intelligence in Angers, France, 2014. In order to model the changing beliefs of an agent, one must actually address two distinct issues. First, one must devise a model of static beliefs that accurately captures the appropriate notions of incompleteness and uncertainty. Second, one must define appropriate operations to model the way beliefs are modified in response to different events. Historically, the former is addressed through the use of modal logics and the latter is addressed through belief change operators. However, these two formal approaches are not particularly complementary; the normal representation of belief in a modal logic is not suitable for revision using standard belief change operators. In this paper, we introduce a new modal logic that uses the accessibility relation to encode epistemic entrenchment, and we demonstrate that this logic captures AGM revision. We consider the suitability of our new representation of belief, and we discuss potential advantages to be exploited in future work., Conference paper, Published.
Bluetooth for decoy systems
Proceedings of 2017 IEEE Conference on Communications and Network Security (CNS) in Las Vegas, NV, USA, USA, 9-11 Oct. 2017. We present an approach to tracking the behaviour of an attacker on a decoy system, where the decoy communicates with the real system only through low energy bluetooth. The result is a low-cost solution that does not interrupt the live system, while limiting potential damage. The attacker has no way to detect that they are being monitored, while their actions are being logged for further investigation. The system has been physically implemented using Raspberry PI and Arduino boards to replicate practical performance., Conference paper, Published.
Blurring boundaries: emergent technological practices of post-secondary students with mathematics learning disabilities
Not peer reviewed, Conference paper, Not yet published, conference in November 2019.

Pages