Synthesising terminating tableau calculi for relational logics (invited paper)

Renate A. Schmidt

doi:10.1007/978-3-642-21070-9_3

Synthesising terminating tableau calculi for relational logics (invited paper)

Research output: Contribution to conference › Other

Abstract

Tableau-based deduction is an active and well-studied area of several branches of logic and automated reasoning. In this paper we discuss the challenge of automatically generating tableau calculi from the semantic specification of logics, while guaranteeing soundness, completeness and termination, when possible. © 2011 Springer-Verlag.

Original language	English
Pages	40-49
Number of pages	9
DOIs	https://doi.org/10.1007/978-3-642-21070-9_3
Publication status	Published - 2011
Event	12th International Conference on Relational and Algebraic Methods in Computer Science, RAMICS 2011 - Rotterdam Duration: 1 Jul 2011 → …

Conference

Conference	12th International Conference on Relational and Algebraic Methods in Computer Science, RAMICS 2011
City	Rotterdam
Period	1/07/11 → …

Access to Document

10.1007/978-3-642-21070-9_3

Cite this

@conference{c27d576498414dbbb316f08de79ddf1a,

title = "Synthesising terminating tableau calculi for relational logics (invited paper)",

abstract = "Tableau-based deduction is an active and well-studied area of several branches of logic and automated reasoning. In this paper we discuss the challenge of automatically generating tableau calculi from the semantic specification of logics, while guaranteeing soundness, completeness and termination, when possible. {\textcopyright} 2011 Springer-Verlag.",

author = "Schmidt, {Renate A.}",

year = "2011",

doi = "10.1007/978-3-642-21070-9_3",

language = "English",

pages = "40--49",

note = "12th International Conference on Relational and Algebraic Methods in Computer Science, RAMICS 2011 ; Conference date: 01-07-2011",

}

TY - CONF

T1 - Synthesising terminating tableau calculi for relational logics (invited paper)

AU - Schmidt, Renate A.

PY - 2011

Y1 - 2011

N2 - Tableau-based deduction is an active and well-studied area of several branches of logic and automated reasoning. In this paper we discuss the challenge of automatically generating tableau calculi from the semantic specification of logics, while guaranteeing soundness, completeness and termination, when possible. © 2011 Springer-Verlag.

AB - Tableau-based deduction is an active and well-studied area of several branches of logic and automated reasoning. In this paper we discuss the challenge of automatically generating tableau calculi from the semantic specification of logics, while guaranteeing soundness, completeness and termination, when possible. © 2011 Springer-Verlag.

U2 - 10.1007/978-3-642-21070-9_3

DO - 10.1007/978-3-642-21070-9_3

M3 - Other

SP - 40

EP - 49

T2 - 12th International Conference on Relational and Algebraic Methods in Computer Science, RAMICS 2011

Y2 - 1 July 2011

ER -

Synthesising terminating tableau calculi for relational logics (invited paper)

Abstract

Conference

Access to Document

Fingerprint

Cite this