Technical, Research Report
@TechReport
Technischer-, Forschungsbericht


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:




Library Locked Library locked





Author, Editor

Author(s):

Horbach, Matthias
Weidenbach, Christoph

dblp
dblp



Editor(s):





BibTeX Citekey*:

Horbach2009TR1

Language:

English

Title, Institution

Title*:

Deciding the Inductive Validity of Forall Exists* Queries

Institution*:

Max-Planck-Institut für Informatik

Publishers or Institutions Address*:

Saarbrücken

Type:

Research Report

No, Year, pp.,

Number*:

MPI-I-2009-RG1-001

Pages*:

48

Month:

May

VG Wort
Pages*:


Year*:

2009

ISBN/ISSN:






DOI:




Note, Abstract, ©

Note:


(LaTeX) Abstract:

We present a new saturation-based decidability result for inductive validity.
Let $\Sigma$ be a finite signature in which all function symbols are at most unary and let $N$ be a satisfiable Horn clause set without equality in which all positive literals are linear.
If $N\cup\{A_1,\ldots,A_n\rightarrow\}$ belongs to a finitely saturating clause class, then it is decidable whether a sentence of the form $\forall\exists^* (A_1\wedge\ldots\wedge A_n)$ is valid in the minimal model of $N$.

Categories / Keywords:

decidability, inductive reasoning, saturation-based theorem proving

Copyright Message:


HyperLinks / References / URLs:


Personal Comments:


File Upload:


Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Automation of Logic

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort


BibTeX Entry:
@TECHREPORT{Horbach2009TR1,
AUTHOR = {Horbach, Matthias and Weidenbach, Christoph},
TITLE = {Deciding the Inductive Validity of Forall Exists* Queries},
YEAR = {2009},
TYPE = {Research Report},
INSTITUTION = {Max-Planck-Institut für Informatik},
NUMBER = {MPI-I-2009-RG1-001},
PAGES = {48},
ADDRESS = {Saarbr{\"u}cken},
MONTH = {May},
}


Entry last modified by Anja Becker, 03/25/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
[Library]
Created
01/18/2010 08:22:29 AM
Revision
1.
0.


Editor
Anja Becker
Matthias Horbach


Edit Date
25.03.2010 11:43:42
18.01.2010 08:22:29


Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section

View attachments here:


File Attachment Icon
decIndQueries_TR.pdf