About: Combined Covers and Beth Definability

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Combined Covers and Beth Definability Goto Sponge NotDistinct Permalink

An Entity of Type : schema:ScholarlyArticle, within Data Space : covidontheweb.inria.fr associated with source document(s)

Attributes	Values
type	Academic Article research paper schema:ScholarlyArticle
isDefinedBy	Covid-on-the-Web dataset
has title	Combined Covers and Beth Definability
Creator	Calvanese, Diego Ghilardi, Silvio Gianola, Alessandro Montali, Marco Rivkin, Andrey
Source	PMC
abstract	Uniform interpolants were largely studied in non-classical propositional logics since the nineties, and their connection to model completeness was pointed out in the literature. A successive parallel research line inside the automated reasoning community investigated uniform quantifier-free interpolants (sometimes referred to as “covers”) in first-order theories. In this paper, we investigate cover transfer to theory combinations in the disjoint signatures case. We prove that, for convex theories, cover algorithms can be transferred to theory combinations under the same hypothesis needed to transfer quantifier-free interpolation (i.e., the equality interpolating property, aka strong amalgamation property). The key feature of our algorithm relies on the extensive usage of the Beth definability property for primitive fragments to convert implicitly defined variables into their explicitly defining terms. In the non-convex case, we show by a counterexample that cover may not exist in the combined theories, even in case combined quantifier-free interpolants do exist.
has issue date	2020-05-30(xsd:dateTime)
bibo:doi	10.1007/978-3-030-51074-9_11
has license	no-cc
sha1sum (hex)	55977712092b4e2ac6c4d152ce67df2ca7870a72
schema:url	https://doi.org/10.1007/978-3-030-51074-9_11
resource representing a document's title	Combined Covers and Beth Definability
has PubMed Central identifier	PMC7324127
schema:publication	Automated Reasoning
resource representing a document's body	covid:55977712092b4e2ac6c4d152ce67df2ca7870a72#body_text
is schema:about of	named entity 'aka' named entity 'cover' named entity 'exist' named entity 'quantifier-free' named entity 'SIGNATURES' named entity 'EXTENSIVE' named entity 'USAGE' named entity 'INVESTIGATE' named entity 'FREE' named entity 'AKA' named entity 'LINE' named entity 'POINTED' named entity 'first-order theories' named entity 'connection' named entity 'amalgamation property' named entity 'theories' named entity 'combinations' named entity 'referred' named entity 'quantifier-free' named entity 'defined' named entity 'non-convex' named entity 'Beth definability' named entity 'quantifier-free' named entity 'interpolating' named entity 'quantifier-free' named entity 'quantifier-free' named entity 'integer' named entity 'model checking' named entity 'quantifier-free' named entity 'propositional logic' named entity 'Löwenheim' named entity 'arithmetic' named entity 'Beth definability' named entity 'model checking' named entity 'interpolants' named entity 'quantifier-free' named entity 'quantifier-free formula' named entity 'integer' named entity 'ISCAS' named entity 'Lemma' named entity 'existentially quantified variables' named entity 'interpolant' named entity 'arithmetics' named entity 'ArXiv' named entity 'partition' named entity 'propositional logic' named entity 'monotonic' named entity 'Lemma' named entity 'interpolants' named entity 'effectively computed' named entity 'SMT' named entity 'countable' named entity 'algorithm' named entity 'quantifier elimination' named entity 'universal Horn theory' named entity 'predicate' named entity 'algorithm' named entity 'predicate symbol' named entity 'Gödel' named entity 'recursively' named entity 'bijection' named entity 'arithmetics' named entity 'disjoint' named entity 'Lemma' named entity 'tuple' named entity 'algorithm' named entity 'algorithm' named entity 'Boolean' named entity 'Boolean' named entity 'equivalence class' named entity 'Beth definability' named entity 'definability' named entity 'disjoint' named entity 'equational theory' named entity 'interpolants' named entity 'quantifier-free' named entity 'automated reasoning' named entity 'interpolant' named entity 'free variables'

Faceted Search & Find service v1.13.91 as of Mar 24 2020

Alternative Linked Data Documents: Sponger | ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software