Semantic Preferential Subsumption
We present a general preferential semantic framework for plausible subsumption in description logics, analogous to the KLM preferential semantics for propositional entailment. We introduce the notion of ordered interpretations for description logics, and use it to define two mutually dual non-deductive subsumption relations ***⊑ and ***⊑*. We outline their properties and explain how they may be used for inductive and abductive reasoning respectively. We show that the preferential semantics for subsumption can be reduced to standard semantics of a sufficiently expressive description logic. This has the advantage that standard DL algorithms can be extended to reason about our notions of plausible subsumption.

title: Merging Epistemic States
abstract: Intelligent agents are often faced with the problem of trying to merge possibly conflicting pieces of information obtained from different sources into a consistent view of the world. We propose a framework for the modelling of such merging operations with roots in the work of Spohn . Unlike most approaches we focus on the merging of epistemic states, not knowledge bases. We construct a number of plausible merging operations and measure them against various properties that merging operations ought to satisfy. Finally, we discuss the connection between merging and the use of infobases , .

title: Sydney OWL Syntax - towards a Controlled Natural Language Syntax for OWL 1.1
abstract: This paper describes a proposed new syntax that can be used to write and read OWL ontologies in Controlled Natural Language (CNL): a well-defined subset of the English language. Following the lead of Manchester OWL Syntax in making OWL more accessible for non-logicians, and building on the previous success of Schwitter’s PENG (Processable English), the proposed Sydney OWL Syntax enables two-way translation and generation of grammatically correct full English sentences to and from OWL 1.1 functional syntax. Used in conjunction with OWL tools, it is designed to facilitate ontology construction and editing by enabling authors to write an OWL ontology in a defined subset of English. It also improves readability and understanding of OWL statements or whole ontologies, by enabling them to be read as English sentences. It is hoped that by providing the option of an intuitive, easy to use English syntax which requires no specialized knowledge, the broader community will be far more likely to develop and benefit from Semantic Web applications. This paper is a discussion paper covering the scope, design, and examples of Sydney OWL Syntax in use, and the authors invite feedback on all aspects of the proposal via email to krr.sydneysyntax@cse.unsw.edu.au. Working drafts of the full specification are available at http://www.ics.mq.edu.au/~rolfs/sos.

title: Modelling Object Typicality in Description Logics
abstract: We present a semantic model of typicality of concept members in description logics (DLs) that accords well with a binary, globalist cognitive model of class membership and typicality. We define a general preferential semantic framework for reasoning with object typicality in DLs. We propose the use of feature vectors to rank concept members according to their defining and characteristic features, which provides a modelling mechanism to specify typicality in composite concepts.

title: Next Steps in Propositional Horn Contraction
abstract: Standard belief contraction assumes an underlying logic containing full classical propositional logic, but there are good reasons for considering contraction in less expressive logics. In this paper we focus on Horn logic. In addition to being of interest in its own right, our choice is motivated by the use of Horn logic in several areas, including ontology reasoning in description logics. We consider three versions of contraction: entailment-based and inconsistency-based contraction (e-contraction and i-contraction, resp.), introduced by Delgrande for Horn logic, and package contraction (p-contraction), studied by Fuhrmann and Hansson for the classical case. We show that the standard basic form of contraction, partial meet, is too strong in the Horn case. We define more appropriate notions of basic contraction for all three types above, and provide associated representation results in terms of postulates. Our results stand in contrast to Delgrande's conjectures that orderly maxichoice is the appropriate contraction for both e- and i-contraction. Our interest in p-contraction stems from its relationship with an important reasoning task in ontological reasoning: repairing the subsumption hierarchy in EL. This is closely related to p-contraction with sets of basic Horn clauses (Horn clauses of the form p → q). We show that this restricted version of p-contraction can also be represented as i-contraction.

title: Implementing Iterated Belief Change Via Prime Implicates
abstract: Belief change is concerned with modelling the way in which an idealised (rational) reasoner maintains their beliefs and the way in which those beliefs are modified as the reasoner acquires new information. The AGM [1,3,5] framework is the most widely cited belief change methodology in the literature. It models the reasoner’s belief state as a set of sentences that is logically closed under deduction and provides for three belief change operations: expansion, contraction and revision. Each of the AGM belief change operations is motivated by principles of rationality that are formalised by way of rationality postulates.

title: On algorithmically checking whether a Hilbert series comes from a complete intersection
abstract: It is not possible to determine from the Hilbert series whether a commutative Z-graded Noetherian algebra is a complete intersection. Nevertheless, the Hilbert series of a complete intersection satisfies very stringent conditions and we define a concept CI-type for formal power series, that embodies some of these necessary properties. This definition becomes interesting mainly for algebras that are not standard i.e. not generated in degree 1. For the class of formal power series that occur as the Hilbert series of Z-graded Noetherian Cohen-Macaulay algebras, the main result is a criterion for a series to be of CI-type, that is formulated in terms of properties of truncated power series. Hence it can be used as the basis for an algorithm that provides in a finite number of steps either a rational function expression of the formal power series, or the information that the truncated power series is not of CI-type. Also sample computations using this algorithm on some non-standard graded invariant algebras are described.

title: Identification of cylin-dependent kinase 1 inhibitors of a new chemical type by structure-based design and database searching
abstract: We have selected cyclin-dependent kinase 1 (CDK1), an enzyme participating in the regulation of the cell cycle, as a target in our efforts to discover new antitumor agents. By exploiting available structural information, we designed an ATP-site directed ligand scaffold that allowed us to identify 4-(3-methyl-1,4-dioxo-1,4-dihydro-naphthalen-2-ylamino)-benzenesulfonamide as a new potent inhibitor of CDK1 in a subsequent database search. The synthesis and testing of some analogues confirmed the interest of this class of compounds as novel CDK1 inhibitors.

title: TAS and IsaWin: Generic Interfaces for Transformational Program Development and Theorem Proving
abstract: We present a new approach to the implementation of graphical user interfaces (GUIs) for formal program development systems like transformation systems or interactive theorem provers. Its distinguishing feature is a generic, open system design which allows the development of a family of tools for different formal methods on a sound logical basis with a uniform appearance. The context of this work is the UniForM project [KPO+95], the aim of which is to develop a framework integrating different formal methods in a logically consistent way. Consistency is achieved by encoding formal methods such as CSP and Z in the theorem prover Isabelle [Pau94], which is used to perform the program development as well as to prove the correctness of the transformation rules. One of the main UniForM objectives is to enable non-expert users to actually perform at least part of the developmen~ themselves. Hence there is a crucial need for an encapsulation technique of these Isabelle encodings providing a generic way of building graphical user interfaces.

title: Multimedia synchronization techniques: experiences based on different system structures
abstract: Multimedia synchronization" is needed to ensure a temporal ordering of events in multimedi a systems . There are two parts to this problem : the definition of temporal relationships among audio , video, and other data ; and the delivery of the data in accordance with these relationships . It i s important to distinguish between liveand synthetic-synchronization . Live-synch, deals with th e presentation of information in the same order as it was originally collected . For synthetic-synch . various pieces of information must be properly ordered and synchronized in time . Based on th e experiences in DiME and HeiTS, we document the implications of using a hybrid or a unified syste m structures on the required techniques for implementing synchronization .

title: Collage Grammars for Collision-Free Growing of Objects in 3D Scenes
abstract: In the real world, solid objects rarely collide without serious damage. We study collision-freeness in the context of collage grammars, which are picture- and scene-generating devices based on hyperedge replacement. We identify a type of collage grammars that generate only collision-free collages, and prove the undecidability of the problem whether an arbitrary collage grammar generates any collision-free collage. Moreover, we discuss collision avoidance in the derivation process as an appropriate tool for practical modelling purposes.