14,298 Hits in 5.8 sec

Model transformation specification for automated formal verification

Asmiza Abdul Sani, Fiona A. C. Polack, Richard F. Paige
2011 2011 Malaysian Conference in Software Engineering  
The approach is illustrated with a small example, UML Class to Relational Database transformation, and verification using Alloy.  ...  , automatically produce equivalent formal specification with analysis capabilities.  ...  Formal Template Language (FTL) The FTL is a template language used in [23] for the GeFoRME approach for analysing UML Class and State diagrams using Z, by instantiating true-by-construction formal templates  ... 
doi:10.1109/mysec.2011.6140647 fatcat:qj6x4o7byzbtzoqzd5o2gz4e3q

Controlled Natural Languages for language generation in artificial cognition

Nicholas H. Kirk, Daniel Nyga, Michael Beetz
2014 2014 IEEE International Conference on Robotics and Automation (ICRA)  
In this paper we discuss, within the context of artificial assistants performing everyday activities, a resolution method to disambiguate missing or not satisfactorily inferred action-specific information  ...  We additionally provide implemented working scenarios, state future possibilities and problems related to verbalization of technical cognition when making use of Controlled Natural Languages.  ...  In reference to filling missing information such as objects or actions in verb-oriented formalizations, a large amount of research has been done in order to provide databases of conceptualizations of actions  ... 
doi:10.1109/icra.2014.6907843 dblp:conf/icra/KirkNB14 fatcat:ywz6yrxnabd3rbwuecslqluyei

Investigating a multi-paradigm system for the management of archaeological data: Corpus Lapidum Burgundiae

Eric Leclercq, Marinette Savonnet, Andres Troya-Galvis, Stephane Buttner
2013 2013 Digital Heritage International Congress (DigitalHeritage)  
We describe the Burgundy Stone project and we show how our approach is instantiated in a collaborative Web platform that allows researchers to build and publish a corpus.  ...  We develop a formal model for ontological-based annotations, we show that this model conforms to a semi-ring algebraic structure and we define a subset of algebraic operator to query annotations.  ...  Annotation can be formally represented by a string belonging to a given alphabet Σ = { , ♦, a, ..., z, A, ..., Z, ( , ) , , }. Σ * is the set of words in alphabet Σ and K ⊂ Σ * .  ... 
doi:10.1109/digitalheritage.2013.6743816 dblp:conf/dh/LeclercqSTB13 fatcat:r47vo7l7czh6hb2kpinexf425e

Tableau Techniques for Querying Information Sources through Global Schemas [chapter]

Gösta Grahne, Alberto O. Mendelzon
1999 Lecture Notes in Computer Science  
We characterize the set of answers to a global query and give algorithms to compute a nite representation of this possibly in nite set, as well as its certain and possible approximations.  ...  We show that generalizations of the classical tableau representation of conjunctive queries are useful for computing query answers in information integration systems where information sources are modeled  ...  Towards this end we shall rst construct a database template over the global relation names. This database template will represent the set of possible databases for S. Let R be a global schema.  ... 
doi:10.1007/3-540-49257-7_21 fatcat:kn5jrodxjnfo3lo65gvlioilpu

Introducing DRAIL – a Step Towards Declarative Deep Relational Learning

Xiao Zhang, María Leonor Pacheco, Chang Li, Dan Goldwasser
2016 Proceedings of the Workshop on Structured Prediction for NLP  
We introduce DRAIL, a new declarative framework for specifying Deep Relational Models.  ...  We show the DRAIL formulation of two NLP tasks, Twitter Part-of-Speech tagging and Entity-Relation extraction.  ...  DRAIL then creates a simple in-memory relational database instance by loading raw data, based on the rule templates created.  ... 
doi:10.18653/v1/w16-5906 dblp:conf/emnlp/ZhangPLG16 fatcat:bxkaa7kqgvbdho5sil5hcom3r4

XLWrap – Querying and Integrating Arbitrary Spreadsheets with SPARQL [chapter]

Andreas Langegger, Wolfram Wöß
2009 Lecture Notes in Computer Science  
In this paper we will present a novel mapping approach for spreadsheets which is based on template graphs similar to RDF123 [5], which we will explain in the related work part.  ...  when creating a formal mapping.  ...  In Section 3 related work is discussed. In Section 4 the XLWrap mapping formalism is presented and in Section 5 the transformation process is explained.  ... 
doi:10.1007/978-3-642-04930-9_23 fatcat:44gpujzb6vb7xlny5fgpvcirb4

Towards a Self-Reflective, Context-Aware Semantic Representation of Mathematical Specifications [chapter]

Peter Schodl, Arnold Neumaier, Kevin Kofler, Ferenc Domes, Hermann Schichl
2011 Algebraic Modeling Systems  
We discuss a framework for the representation and processing of mathematics developed within and for the MOSMATH project.  ...  Arguments are given why this framework appears to be well suited for the representation and processing of arbitrary mathematics.  ...  optimization in a form that is natural for the working mathematician.  ... 
doi:10.1007/978-3-642-23592-4_2 fatcat:tscq3tybrfcsldawrj7vssbhsm

Towards an open software architecture for interleaved knowledge and natural language processing

Marcus Spies
2015 Scientific Publications of the State University of Novi Pazar Series A Applied Mathematics Informatics and mechanics  
In this paper, the emerging importance of interleaved knowledge and language processing in the context of cognitive computing is shown.  ...  Recent progress in NLP, however, has brought "deep" processing features like sentential parsing and semantic dependency analysis to a highly mature level for a substantial set of common spoken languages  ...  In a factored lexicon, a candidate semantic representation for − → w l is constructed as composition of a lexeme relation with a lexical template.  ... 
doi:10.5937/spsunp1501007s fatcat:ahgcthfenrdurox2cc3haxtfnu

An Enhanced Search Interface for Information Discovery from Digital Libraries [chapter]

Georgia Koutrika, Alkis Simitsis
2006 Lecture Notes in Computer Science  
However, most users have no specific knowledge of schemas or structured query languages for accessing information stored in (relational or XML) databases.  ...  Therefore, the answer to a précis query might also contain information found in other parts of the database.  ...  The template label label(u,z) of an edge e(u,z) formally comprises the following parts: (a) lid, a unique identifier for the label in the database graph; (b) l(u), the name of the starting node; (c) l(  ... 
doi:10.1007/11863878_8 fatcat:idckvjenqzasxjsiqfvhi5ci4m

Towards programming languages for genetic engineering of living cells

M. Pedersen, A. Phillips
2009 Journal of the Royal Society Interface  
While current limitations on available data prevent full use of the language in practical applications, the language can be used to develop formal models of synthetic systems, which are otherwise often  ...  Programs can be translated by a compiler into sequences of standard biological parts, a process that relies on logic programming and prototype databases that contain known biological parts and protein  ...  The parts database, in spite of being incomplete, points towards the logical properties that must be formally associated with parts if languages and compilers of the kind presented in this paper are to  ... 
doi:10.1098/rsif.2008.0516.focus pmid:19369220 pmcid:PMC2843955 fatcat:ukm4exh7lrfolfillxduwre7qy

Design Patterns for Legal Ontology Constructions

Aldo Gangemi
2007 International Conference on Artificial Intelligence and Law  
are included, showing their utility in a simple legal modeling case  ...  An overview of the typical tasks and services for legal knowledge is presented, the notion of ontology design pattern is introduced, and some excerpts of a reference ontology (CLO) and its related patterns  ...  For example, a connected path of two relations and three classes (A(x ) ∋ B(y) ∋ C(z ) ∋ R(x,y) ∋ S(y,z )) can be extracted as a sub-theory of an ontology O because of its relevance in a domain.  ... 
dblp:conf/icail/Gangemi07 fatcat:z4a3rf6bffgl7itmlawq6r5heq

Towards NeuroML: Model Description Methods for Collaborative Modelling in Neuroscience

N. H. Goddard, M. Hucka, F. Howell, H. Cornelis, K. Shankar, D. Beeman
2001 Philosophical Transactions of the Royal Society of London. Biological Sciences  
We report our ¢ndings on the requirements for these tools and discuss the use of declarative forms of model descriptionöequivalent to object-oriented classes and database schemaöwhich we call templates  ...  We introduce NeuroML, a mark-up language for the neurosciences which is de¢ned syntactically using templates, and its speci¢c component intended as a common format for communication between modelling-related  ...  For handling representations in a diverse collection of databases, simulation environments, and other software tools, XML o¡ers three key features: (i) Separation of the template description (in the form  ... 
doi:10.1098/rstb.2001.0910 pmid:11545699 pmcid:PMC1088511 fatcat:6kmfcrxjufe4bokitratpldnzi

A deductive system for proving workflow models from operational procedures

Rune Rasmussen, Ross Brown
2012 Future generations computer systems  
In this paper we present a mathematical framework for deducing tasks in workflow models from plans in mechanistic or strongly controlled work environments, with a focus around automatic plan generations  ...  The result is a logical framework that can be used to prove tasks in workflow hierarchies from operational information about work processes and machine configurations in controlled or mechanistic work  ...  In the case where the kPN database is uninformative, planning algorithms can be devised to return partial plans from the PU database towards a similar analysis.  ... 
doi:10.1016/j.future.2012.01.001 fatcat:jhx5gn2lpzhd5ouliamntuegti

Knowledge and Business Processes: Approaching an Integration [chapter]

Steffen Staab, Hans-Peter Schnurr
2002 Knowledge Management and Organizational Memories  
This paper describes a principled approach towards creating an IT-support environment for knowledge workers.  ...  Starting in the analysis phase our approach paves the way for putting an intelligent assistant to work within a typical business process environment.  ...  The semiformal knowledge representation is also the basis for formalization, resulting in a formal and executable model, specified in the Knowledge Acquisition and Representation Language (KARL).  ... 
doi:10.1007/978-1-4615-0947-9_7 fatcat:nfhhv5ymvjddhnyiiqujoghbpm

Learning To Align Polyphonic Music

Shai Shalev-Shwartz, Joseph Keshet, Yoram Singer
2004 Zenodo  
In addition, the ability to align between symbolic and acoustic representations is an essential first step toward a polyphonic note detection system (see also [18, 20, 9] ).  ...  These datasets would serve as a necessary step towards the implementation of a polyphonic note detection system. a 2 aFigure 1 . 21 Choose next example:(z,ȳ) = arg max{γ(ȳ, f (z)) : (z,ȳ) ∈ S} ; = γ(ȳ,  ... 
doi:10.5281/zenodo.1416545 fatcat:vcuesjhlozgd7mgr4npzfqksii
« Previous Showing results 1 — 15 out of 14,298 results