3125532
Structure-based design of potent CDK1 inhibitors derived from olomoucine
Cyclin-dependent kinase 1 (CDK1), an enzyme participating in the regulation of the cell cycle, constitutes a possible target in the search for new antitumor agents. Starting from the purine derivative olomoucine and following a structure-based approach, potent inhibitors of this enzyme were rapidly identified. The molecular modeling aspects of this work are described.
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.
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.
15894793
Implementing Iterated Belief Change Via Prime Implicates
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.
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.
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.
116472242
Proceedings of the second Australasian workshop on Advances in ontologies - Volume 72
The first two Australasian Ontology Workshops (AOW 2005 and AOW 2006) were held in Sydney and Hobart, respectively, both as workshops of the Australian Joint Conference on Artificial Intelligence (AI'05, and AI'06). This tradition is being continued this year, with AOW 2007 being held on the Gold Coast in Queensland, Australia, again as workshop of the Australian Joint Conference on Artificial Intelligence (AI'07).