scholarly journals Capability Discovery for Automated Reasoning Systems

10.29007/fsv3 ◽  
2018 ◽  
Author(s):  
Alexander Steen ◽  
Max Wisniewski ◽  
Hans-Jörg Schurr ◽  
Christoph Benzmüller
Keyword(s):  
Automated Reasoning ◽  
Theorem Provers ◽  
Reasoning Systems ◽  
Machine Readable ◽  
Concrete Choice

Automated reasoning systems such as theorem provers often employ interaction or cooperation with further reasoning software. Whereas in most cases the concrete choice of cooperating software is, to some extent, irrelevant, these systems are nevertheless often rigid in practice due to compatibility issues. In order to support more flexible cooperation schemes, a machine-readable description format for automated reasoning systems' capabilities is proposed. Additionally, a simple HTTP-based protocol for system and capability discovery is outlined. Both the format and the protocol are designed to be simple, extensible and easy to use with none to minor modifications for existing reasoning systems.

scholarly journals Preface to the Special Issue on Automated Reasoning Systems

2019 ◽  
Vol 64 (3) ◽  
pp. 361-362
Author(s):  
Armin Biere ◽  
Cesare Tinelli ◽  
Christoph Weidenbach
Keyword(s):  
Automated Reasoning ◽  
Special Issue ◽  
Reasoning Systems

Using Automated Reasoning Systems on Molecular Computing

2005 ◽  
pp. 128-137
Author(s):  
Carmen Graciani Díaz ◽  
Mario J. Pérez-Jiménez
Keyword(s):  
Automated Reasoning ◽  
Molecular Computing ◽  
Reasoning Systems

scholarly journals AMALGAMATING KNOWLEDGE BASES II: DISTRIBUTED MEDIATORS

1994 ◽  
Vol 03 (04) ◽  
pp. 349-383 ◽  
Author(s):  
SIBEL ADALI ◽  
V. S. SUBRAHMANIAN
Keyword(s):  
Automated Reasoning ◽  
Knowledge Bases ◽  
Multiple Sources ◽  
Link Failures ◽  
Reasoning Systems ◽  
Network Link ◽  
Different Types ◽  
Individual Knowledge ◽  
Temporal Structures ◽  
The Individual

Integrating knowledge from multiple sources is an important aspect of automated reasoning systems. In [23], we presented a uniform declarative and operational framework, based on annotated logics, for amalgamating multiple knowledge bases and data structures (e.g. relational, object-oriented, spatial, and temporal structures) when these knowledge bases (possibly) contain inconsistencies, uncertainties and non-monotonic modes of negation. We showed that annotated logics may be used, with some modifications, to mediate between different knowledge bases. The multiple knowledge bases are amalgamated by embedding the individual knowledge bases into a lattice. In this paper, we describe how, given a network of sites where the different databases reside, it is possible to define a distributed semantics for amalgamated knowledge bases. More importantly, we study how the mediator may be distributed across multiple sites so that when certain conditions are satisfied, network failures do not affect the end results of queries that a user may pose. We specify different ways of distributing the mediator to protect against different types of network link failures and develop alternative soundness and completeness results.

scholarly journals Extension of Ontologies Assisted by Automated Reasoning Systems

2005 ◽  
pp. 247-253 ◽  
Author(s):  
Joaquín Borrego-Díaz ◽  
Antonia M. Chávez-González
Keyword(s):  
Automated Reasoning ◽  
Reasoning Systems

A Child’s Story to Illustrate Automated Reasoning Systems Using Opportunity and History

2006 ◽  
pp. 668-670
Author(s):  
James D. Jones ◽  
Hemant Joshi ◽  
Umit Topaloglu ◽  
Eric Nelson
Keyword(s):  
Automated Reasoning ◽  
Reasoning Systems

An Architecture for Automated Reasoning Systems for Genome-Wide Studies

2009 ◽  
pp. 426-430 ◽  
Author(s):  
Angelo Nuzzo ◽  
Alberto Riva ◽  
Mario Stefanelli ◽  
Riccardo Bellazzi
Keyword(s):  
Automated Reasoning ◽  
Reasoning Systems ◽  
Genome Wide

Empirically Successful Automated Reasoning: Systems Issue

2006 ◽  
Vol 36 (4) ◽  
pp. 287-287
Author(s):  
Bernd Fischer ◽  
Geoff Sutcliffe ◽  
Stephan Schulz
Keyword(s):  
Automated Reasoning ◽  
Reasoning Systems

Machine-readable codes

1986 ◽  
Vol 65 (1) ◽  
pp. 9
Author(s):  
C.W. Painter
Keyword(s):  
Machine Readable

The Use of Medical Record Linkage for Population and Genetic Studies

1969 ◽  
Vol 08 (01) ◽  
pp. 07-11 ◽  
Author(s):  
H. B. Newcombe
Keyword(s):  
Record Linkage ◽  
Large Scale ◽  
Medical Record Linkage ◽  
Canadian Province ◽  
Genetic Studies ◽  
Parental Characteristics ◽  
Family Histories ◽  
The Family ◽  
Large Populations ◽  
Machine Readable

Methods are described for deriving personal and family histories of birth, marriage, procreation, ill health and death, for large populations, from existing civil registrations of vital events and the routine records of ill health. Computers have been used to group together and »link« the separately derived records pertaining to successive events in the lives of the same individuals and families, rapidly and on a large scale. Most of the records employed are already available as machine readable punchcards and magnetic tapes, for statistical and administrative purposes, and only minor modifications have been made to the manner in which these are produced.As applied to the population of the Canadian province of British Columbia (currently about 2 million people) these methods have already yielded substantial information on the risks of disease: a) in the population, b) in relation to various parental characteristics, and c) as correlated with previous occurrences in the family histories.

A Structured Method for the Recognition of Complex Historical Tables

1997 ◽  
Vol 9 (1-3) ◽  
pp. 58-77
Author(s):  
Vitaly Kliatskine ◽  
Eugene Shchepin ◽  
Gunnar Thorvaldsen ◽  
Konstantin Zingerman ◽  
Valery Lazarev
Keyword(s):  
Nineteenth Century ◽  
Character Recognition ◽  
Optical Character Recognition ◽  
Complex Structure ◽  
Source Material ◽  
Historical Sources ◽  
Tax Assessment ◽  
Optical Character ◽  
Algorithmic Model ◽  
Machine Readable

In principle, printed source material should be made machine-readable with systems for Optical Character Recognition, rather than being typed once more. Offthe-shelf commercial OCR programs tend, however, to be inadequate for lists with a complex layout. The tax assessment lists that assess most nineteenth century farms in Norway, constitute one example among a series of valuable sources which can only be interpreted successfully with specially designed OCR software. This paper considers the problems involved in the recognition of material with a complex table structure, outlining a new algorithmic model based on ‘linked hierarchies’. Within the scope of this model, a variety of tables and layouts can be described and recognized. The ‘linked hierarchies’ model has been implemented in the ‘CRIPT’ OCR software system, which successfully reads tables with a complex structure from several different historical sources.

Sign in / Sign up

Export Citation Format

Share Document