About: Incremental Closure for Systems of Two Variables Per Inequality

Not logged in : Login

(Sponging disallowed)

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Incremental Closure for Systems of Two Variables Per Inequality Goto Sponge NotDistinct Permalink

An Entity of Type : bibo:AcademicArticle, within Data Space : linkeddata.uriburner.com:28898 associated with source document(s)

Attributes	Values
type	http://eprints.org/ontology/ArticleEPrint http://eprints.org/ontology/EPrint Article Academic Article
seeAlso	HTML Summary of #70546 Incremental Closure for Systems of Two Variables Per Inequality
sameAs	Incremental Closure for Systems of Two Variables Per Inequality
http://eprints.org/ontology/hasAccepted	Incremental Closure for Systems of Two Variables Per Inequality (PDF)
http://eprints.org/ontology/hasDocument	Incremental Closure for Systems of Two Variables Per Inequality (PDF) Incremental Closure for Systems of Two Variables Per Inequality (Other) Incremental Closure for Systems of Two Variables Per Inequality (Other) Incremental Closure for Systems of Two Variables Per Inequality (Other) Incremental Closure for Systems of Two Variables Per Inequality (Other) Incremental Closure for Systems of Two Variables Per Inequality (Other) Incremental Closure for Systems of Two Variables Per Inequality (PDF) Incremental Closure for Systems of Two Variables Per Inequality (Other) Incremental Closure for Systems of Two Variables Per Inequality (Other) Incremental Closure for Systems of Two Variables Per Inequality (Other) Incremental Closure for Systems of Two Variables Per Inequality (Other) Incremental Closure for Systems of Two Variables Per Inequality (Other)
http://eprints.org/ontology/hasPublished	Incremental Closure for Systems of Two Variables Per Inequality (PDF)
dc:hasVersion	Incremental Closure for Systems of Two Variables Per Inequality (PDF) Incremental Closure for Systems of Two Variables Per Inequality (PDF)
Title	Incremental Closure for Systems of Two Variables Per Inequality
described by	https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/export_kar_RDFN3.n3 https://demo.openlinksw.com/about/id/entity/https/raw.githubusercontent.com/annajordanous/CO644Files/main/export_kar_RDFN3.n3
Date	2019-05-10
Creator	Andy King Axel Simon Jacob M. Howe
status	peer reviewed published
Publisher	Elsevier
abstract	Subclasses of linear inequalities where each inequality has at most two variables are popular in abstract interpretation and model checking, because they strike a balance between what can be described and what can be efficiently computed. This paper focuses on the TVPI class of inequalities, for which each coefficient of each two variable inequality is unrestricted. An implied TVPI inequality can be generated from a pair of TVPI inequalities by eliminating a given common variable (echoing resolution on clauses). This operation, called result, can be applied to derive TVPI inequalities which are entailed (implied) by a given TVPI system. The key operation on TVPI is calculating closure: satisfiability can be observed from a closed system and a closed system also simplifies the calculation of other operations. A closed system can be derived by repeatedly applying the result operator. The process of adding a single TVPI inequality to an already closed input TVPI system and then finding the closure of this augmented system is called incremental closure. This too can be calculated by the repeated application of the result operator. This paper studies the calculus defined by result, the structure of result derivations, and how derivations can be combined and controlled. A series of lemmata on derivations are presented that, collectively, provide a pathway for synthesising an algorithm for incremental closure. The complexity of the incremental closure algorithm is analysed and found to be O((n^2+m^2)lg(m)), where n is the number of variables and $m$ the number of inequalities of the input TVPI system.
Is Part Of	Theoretical Computer Science https://kar.kent.ac.uk/id/repository
Subject	QA 76 Software, computer programming,
list of authors	https://kar.kent.ac.uk/id/eprint/70546#authors
volume	768
is topic of	https://www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/export_kar_RDFN3.n3 https://raw.githubusercontent.com/annajordanous/CO644Files/main/export_kar_RDFN3.n3
is primary topic of	HTML Summary of #70546 Incremental Closure for Systems of Two Variables Per Inequality

Faceted Search & Find service v1.17_git144 as of Jul 26 2024

Alternative Linked Data Documents: iSPARQL | ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3331 as of Aug 25 2024, on Linux (x86_64-ubuntu_noble-linux-glibc2.38-64), Single-Server Edition (378 GB total memory, 13 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software