A collection of papers presented at the First International Summer Institute in Cognitive Science, University at Buffalo, July 1994, including the following papers: ** Topological Foundations of Cognitive Science, Barry Smith ** The Bounds of Axiomatisation, Graham White ** Rethinking Boundaries, Wojciech Zelaniec ** Sheaf Mereology and Space Cognition, Jean Petitot ** A Mereotopological Definition of 'Point', Carola Eschenbach ** Discreteness, Finiteness, and the Structure of Topological Spaces, Christopher Habel ** Mass Reference and the Geometry of Solids, Almerindo E. Ojeda (...) ** Defining a 'Doughnut' Made Difficult, N .M. Gotts ** A Theory of Spatial Regions with Indeterminate Boundaries, A.G. Cohn and N.M. Gotts ** Mereotopological Construction of Time from Events, Fabio Pianesi and Achille C. Varzi ** Computational Mereology: A Study of Part-of Relations for Multi-media Indexing, Wlodek Zadrozny and Michelle Kim. (shrink)

This paper reports on an approach to model generalized implicatures using nonmonotonic logics. The approach, called compositional, is based on the idea of compositional semantics, where the implicatures carried by a sentence are constructed from the implicatures carried by its constituents, but it also includes some aspects nonmonotonic logics in order to model the defeasibility of generalized implicatures.

There has been much talk of the need to build intermediate models of the expertise required preparatory to constructing a knowledge-based system in the legal domain. Such models offer advantages for verification, validation, maintenance and reuse. As yet, however, few such models have been reported at a useful level of detail. In this paper we describe a method for conceptualising legal domains as well as its application to a substantial fragment of the Dutch Unemployment Benefits Act (DUBA).We first discuss the (...) intermediate models (called expertise models), then present a three-stage method for their construction, drawing on the CommonKADS work in knowledge acquisition, conceptual models of statute law, and the KANT method of knowledge analysis. Subsequently, we describe how these techniques were applied to the DUBA, and provide detailed examples of the resulting model. Finally, conclusions on the framework and guidelines are given as well as means of recording and presenting the various design choices. (shrink)

Artificial agents, which are embedded in a virtual world, need to interpret a sequence of commands given to them adequately, considering the temporal structure for each command. In this paper, we start with the semantics of natural language and classify the temporal structures of various eventualities into such aspectual classes as action, process, and event. In order to formalize these temporal structures, we adopt Arrow Logic. This logic specifies the domain for the valuation of a sentence as an arrow. We (...) can connect, or give order to, arrows by defining inter-arrow operations, and can give different views for sentences. Thereafter we formalize the rules of aspectual shifts in situated inference, in the style of a logic programming language. Thus, we not only describe the static representation of temporal features, but also show the dynamic process to deduce how each eventuality is viewed. The rules are applied to the information flow through the sequence of commands; therefore, we consider how the temporal structure of a command affects the succeeding commands. (shrink)

Case-based reasoning has played an important role in legal reasoning systems. As one criteria for similarity of cases, temporal relationsamong affairs in legal cases should be compared. Thus far in many legalreasoning systems, cases have been described as sequences of pointwiseevents, or at best, simple time intervals, and they have been related bypredicates such as before, after, while,and so on. However, such relations may depend on each implementer'spersonal view, and also require much labor to write down by hand. In this (...) paper, we first propose a classification of affair types by their temporal features, and according to those types, we propose several assumption rules that prescribe the temporal relations between affair types. The temporal relations are automatically generated by these rules. Thereafter, we discuss how thesetemporal relations work in the comparison of similarity of cases. Inthe process of comparison, inadequate temporal relations need to beamended. For this purpose, we introduce revision rules, that refute theresults of assumption rules. (shrink)

We describe a prototype ontology-driven information system (ODIS) that exploits what we call Portion of Reality (POR) representations. The system takes both sensor data and natural language text as inputs and composes on this basis logically structured POR assertions. The goal of our prototype is to represent both natural language and sensor data within a single framework that is able to support both axiomatic reasoning and computation. In addition, the framework should be capable of discovering and representing new kinds of (...) situations and thematic roles, (e.g., roles such as agent, patient and instrument), based on new compositions of existing representations. We applied our prototype in an intelligence analysis use case to test the hypothesis that a framework of this sort can produce usefully structured information from combined natural language and sensor data inputs. We further tested our hypothesis by adding an enhanced US Air Force ontology framework to our ODIS in order to (1) process a collection of sensor data, intel reports, and mission plans; (2) build composite POR representations from these data; and (3) machine analyze the fused results to infer mission threats. (shrink)

This paper presents a belief revision operator that considers time intervals for modelling norm change in the law. This approach relates techniques from belief revision formalisms and time intervals with temporalised rules for legal systems. Our goal is to formalise a temporalised belief base and corresponding timed derivation, together with a proper revision operator. This operator may remove rules when needed or adapt intervals of time when contradictory norms are added in the system. For the operator, both constructive definition and (...) an axiomatic characterisation by representation theorems are given. (shrink)

It is suggested that taking into account considerations that traditionally fall within the scope of computer science in general, and artificial intelligence in particular, sheds new light on the subject of causation. It is argued that adopting causal notions con be viewed as filling a computational need: They allow reasoning with incomplete information, facilitate economical representations, and afford relatively efficient methods for reasoning about those representations. Specifically, it is proposed that causal reasoning is intimately bound to nonmonotonic reasoning. An account (...) of causation is offered that relies upon this connection, and compares this proposal to previous accounts within philosophy and artificial intelligence. (shrink)

In this article, we describe an ontology aimed at the representation of the relevant entities and relations in the philosophical world. We will guide the reader through our modeling choices, so to highlight the ontology’s practical purpose: to enable an annotation of philosophical resources which is capable of supporting pedagogical navigation mechanisms. The ontology covers all the aspects of philosophy, thus including characterizations of entities such as people, events, documents, and ideas. In particular, here we will present a detailed exposition (...) of the entities belonging to the idea branch of the ontology, for they have a crucial role in the world of philosophy. Moreover, as an example of the type of applications made possible by the ontology we will introduce PhiloSurfical, a prototype tool we created to navigate contextually a classic work in twentieth century philosophy, Wittgenstein’s Tractatus Logico-Philosophicus. We discuss the potential usage of such navigation mechanisms in educational and scholarly contexts, which aim to enhance the learning process through the serendipitous discovery of relevant resources. (shrink)

We use a graphic formalism to make explicit differences in the interpretation of temporal relations in natural-language text. Out of the panoply of computational representation methods for time or tense, we select Petri nets, and discuss why. We illustrate their potential for semantics and for sign theorists, by analyzing how some late antique and medieval exegeses understood the narrative of Moses and Pharaoh's magicians, and the former's rod swallowing up the rods of the other ones, once these rods had been (...) turned into crocodiles or snakes. We extend the treatment to another situation concerning the semantics of eating and being eaten. (shrink)

As lawmakers produce norms, the underlying normative system is affected showing the intrinsic dynamism of law. Through undertaken actions of legal change, the normative system is continuously modified. In a usual legislative practice, the time for an enacted legal provision to be in force may differ from that of its inclusion to the legal system, or from that in which it produces legal effects. Even more, some provisions can produce effects retroactively in time. In this article we study a simulation (...) of such process through the formalisation of a temporalised logical framework upon which a novel belief revision model tackles the dynamic nature of law. Represented through intervals, the temporalisation of sentences allows differentiating the temporal parameters of norms. In addition, a proposed revision operator allows assessing change to the legal system by including a new temporalised literal while preserving the time-based consistency. This can be achieved either by pushing out conflictive pieces of pre-existing norms or through the modification of intervals in which such norms can be either in force, or produce effects. Finally, the construction of the temporalised revision operator is axiomatically characterised and its rational behavior proved through a corresponding representation theorem. (shrink)

Until is a notoriously difficult temporal operator as it is both existential and universal at the same time: A∪B holds at the current time instant w iff either B holds at w or there exists a time instant w' in the future at which B holds and such that A holds in all the time instants between the current one and ẃ. This “ambivalent” nature poses a significant challenge when attempting to give deduction rules for until. In this paper, in (...) contrast, we make explicit this duality of until by introducing a new temporal operator ∇ that allows us to formalize the “history” of until, i.e., the “internal” universal quantification over the time instants between the current one and ẃ. This approach provides the basis for formalizing deduction systems for temporal logics endowed with the until operator. For concreteness, we give here a labeled natural deduction system N(LTL∇) for a linear-time logic LTL∇ endowed with the new history operator. We show that LTL∇ is equivalent to the linear temporal logic LTL with until, which follows by formalizing back and forth translations between the two logics. We also define an indirect translation from LTL∇ into LTL via temporal logics with past operators; such a result provides an upper bound to the problem of satisfiability for LTL∇ formulas. (shrink)

Research on an expert system regarding unemployment insurance law has pointed to the difficulties of explicitly representing temporal relations. The question has been addressed in the artificial intelligence literature with respect to planning systems and linguistic analysis. The approaches adopted do not appear to be directly transposable to legal discourse. The problem seems so far to have escaped notice amongst researchers attempting to develop legal expert systems. The paper explores in a preliminary way how lawyers use temporal concepts. It is (...) submitted that “legal time” only partly overlaps with real time. A sketch of a formalization of temporal relations in law, following J. F. Allen's approach, is presented. (shrink)

Events have beginnings, ends, and often overlap in time. A major question is how perceivers come to parse a stream of multimodal information into meaningful units and how different event boundaries may vary event processing. This work investigates the roles of these three types of event boundaries in constructing event temporal relations. Predictions were made based on how people would err according to the beginning state, end state, and overlap heuristic hypotheses. Participants viewed animated events that include all the logical (...) possibilities of event temporal relations, and then made temporal relation judgments. The results showed that people make use of the overlap between events and take into account the ends and beginnings, but they weight ends more than beginnings. Neural network simulations showed a self‐organized distinction when learning temporal relations between events with overlap versus those without. (shrink)

Intelligent sensors should be seamlessly, securely, and trustworthy interconnected to enable automated high-level smart applications. Semantic metadata can provide contextual information to support the accessibility of these features, making it easier for machines and humans to process the sensory data and achieve interoperability. The unique overview of sensor ontologies according to the semantic needs of the layers of IoT solutions can serve a guideline of engineers and researchers interested in the development of intelligent sensor-based solutions. The explored trends show that (...) ontologies will play an even more essential role in interlinked IoT systems as interoperability and the generation of controlled linkable data sources should be based on semantically enriched sensory data. (shrink)

In this paper we investigate how to represent and reason about legal abrogations and annulments in Defeasible Logic. We examine some options that embed in this setting, and in similar rule-based systems, ideas from belief and base revision. In both cases, our conclusion is negative, which suggests to adopt a different logical model. This model expresses temporal aspects of legal rules, and distinguishes between two main timelines, one internal to a given temporal version of the legal system, and another relative (...) to how the legal system evolves over time. Accordingly, we propose a temporal extension of Defeasible Logic suitable to express this model and to capture abrogation and annulment. We show that the proposed framework overcomes the difficulties discussed in regard to belief and base revision, and is sufficiently flexible to represent many of the subtleties characterizing legal abrogations and annulments. (shrink)

So-called ‘reified temporal logics’ were introduced by researchers in Artificial Intelligence (AI) in the early 1980s, and gave rise to a long-running series of debates concerning the proper way to represent states, events, causation, action, and other notions identified as crucial to the knowledge representation needs of AI. These debates never resulted in a definitive resolution of the issues under discussion, and indeed continue to produce aftershocks to the present day; none the less, we are now sufficiently far removed in (...) time from their heyday for it to be a worthwhile exercise to stand back and review them as a connected piece of history. (shrink)

There are numerous occasions on which we need to reason about a finite number of events. And we often need to consider only those events which are given or which we perceive. These give rise to the Criteria of Finiteness and Closedness. Allen's logic provides a way of reasoning about events. In this paper I examine Allen and Hayes' axiomatisation of this logic, and develop two other axiomatisations based on the work by Russell and Thomason. I shall show that these (...) three axiomatisations are weakly equivalent, and that only the last two meet the Criteria of Finiteness and Closedness (to different degrees). I shall then examine two ways of constructing instants of time in a finite and closed world, i.e. the Russell construction and the Thomason construction. I shall prove that these two constructions are equivalent under certain conditions. (shrink)