scholarly journals Extension of Ontologies Assisted by Automated Reasoning Systems

Author(s):  
Joaquín Borrego-Díaz ◽  
Antonia M. Chávez-González

2019 ◽  
Vol 64 (3) ◽  
pp. 361-362
Author(s):  
Armin Biere ◽  
Cesare Tinelli ◽  
Christoph Weidenbach


Author(s):  
Carmen Graciani Díaz ◽  
Mario J. Pérez-Jiménez


1994 ◽  
Vol 03 (04) ◽  
pp. 349-383 ◽  
Author(s):  
SIBEL ADALI ◽  
V. S. SUBRAHMANIAN

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.



10.29007/fsv3 ◽  
2018 ◽  
Author(s):  
Alexander Steen ◽  
Max Wisniewski ◽  
Hans-Jörg Schurr ◽  
Christoph Benzmüller

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.



Author(s):  
James D. Jones ◽  
Hemant Joshi ◽  
Umit Topaloglu ◽  
Eric Nelson


Author(s):  
Angelo Nuzzo ◽  
Alberto Riva ◽  
Mario Stefanelli ◽  
Riccardo Bellazzi


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




2021 ◽  
pp. 135406882199025
Author(s):  
Patrick Cunha Silva ◽  
Brian F Crisp

Electoral systems vary in terms of the choice and influence they offer voters. Beyond selecting between parties, preferential systems allow for choices within parties. More proportional systems make it likely that influence over who determines the assembly’s majority will be distributed across relatively more voters. In response to systems that limit choice and influence, we hypothesize that voters will cast more blank, null, or spoiled ballots on purpose. We use a regression discontinuity opportunity in French municipal elections to test this hypothesis. An exogenously chosen and arbitrary cutpoint is used to determine the electoral rules municipalities use to select their assemblies. We find support for our reasoning—systems that do not allow intraparty preference votes and that lead to disproportional outcomes provoke vote spoilage. Rates of vote spoilage are frequently sufficient to change control over the assembly if those votes had instead been cast validly for the second-place party.



Sign in / Sign up

Export Citation Format

Share Document