1871739
Sydney OWL Syntax - towards a Controlled Natural Language Syntax for OWL 1.1
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.
1613464
Merging Epistemic States
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 [14]. 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 [9], [10].
796115
Negotiation as Mutual Belief Revision
This paper presents a logical framework for negotiation based on belief revision theory. We consider that a negotiation process is a course or multiple courses of mutual belief revision. A set of AGM-style postulates are proposed to capture the rationality of competitive and cooperative behaviors of negotiation. We first show that the AGM revision and its iterated extension is a special case of negotiation function. Then we show that a negotiation function can be constructed by two related iterated belief revision functions under a certain coordination mechanism. This provides a qualitative method for constructing negotiation space and rational concessions. It also shows glimpse of how to express game-theoretical concepts in logical framework.
17709737
Finding Maximally Satisfiable Terminologies for the Description Logic ALC
For ontologies represented as Description Logic Tboxes, optimised DL reasoners are able to detect logical errors, but there is comparatively limited support for resolving such problems. One possible remedy is to weaken the available information to the extent that the errors disappear, but to limit the weakening process as much as possible. The most obvious way to do so is to remove just enough Tbox sentences to eliminate the errors. In this paper we propose a tableau-like procedure for finding maximally concept-satisfiable terminologies represented in the description logic ALC. We discuss some optimisation techniques, and report on preliminary, but encouraging, experimental results.
15316733
Admissible and Restrained Revision
As partial justification of their framework for iterated belief revision Darwiche and Pearl convincingly argued against Boutilier's natural revision and provided a prototypical revision operator that fits into their scheme. We show that the Darwiche-Pearl arguments lead naturally to the acceptance of a smaller class of operators which we refer to as admissible. Admissible revision ensures that the penultimate input is not ignored completely, thereby eliminating natural revision, but includes the Darwiche-Pearl operator, Nayak's lexicographic revision operator, and a newly introduced operator called restrained revision. We demonstrate that restrained revision is the most conservative of admissible revision operators, effecting as few changes as possible, while lexicographic revision is the least conservative, and point out that restrained revision can also be viewed as a composite operator, consisting of natural revision preceded by an application of a "backwards revision" operator previously studied by Papini. Finally, we propose the establishment of a principled approach for choosing an appropriate revision operator in different contexts and discuss future work.
15047002
Knowledge Integration for Description Logics
Description logic reasoners are able to detect incoherences (such as logical inconsistency and concept unsatisfiability) in knowledge bases, but provide little support for resolving them. We propose to recast techniques for propositional inconsistency management into the description logic setting. We show that the additional structure afforded by description logic statements can be used to refine these techniques. Our focus in this paper is on the formal semantics for such techniques, although we do provide high-level decision procedures for the knowledge integration strategies discussed.
16322351
On algorithmically checking whether a Hilbert series comes from a complete intersection
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.
2586073
Robustness to Code and Data Deletion in Autocatalytic Quines
Software systems nowadays are becoming increasingly complex and vulnerable to all sorts of failures and attacks. There is a rising need for robust self-repairing systems able to restore full functionality in the face of internal and external perturbations, including those that affect their own code base. However, it is difficult to achieve code self-repair with conventional programming models. 
 
We propose and demonstrate a solution to this problem based on self-replicating programs in an artificial chemistry. In this model, execution proceeds by chemical reactions that modify virtual molecules carrying code and data. Self-repair is achieved by what we call autocatalytic quines : programs that permanently reproduce their own code base. The concentration of instructions reflects the health of the system, and is kept stable by the instructions themselves. We show how the chemistry of such programs enables them to withstand arbitrary amounts of random code and data deletion, without affecting the results of their computations.
13787606
Identification of cylin-dependent kinase 1 inhibitors of a new chemical type by structure-based design and database searching
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.
747572
Multimedia synchronization techniques: experiences based on different system structures
Introduction "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 .
25161687
TAS and IsaWin: Generic Interfaces for Transformational Program Development and Theorem Proving
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.