Relevant bibliographies by topics / Tableaux-based decision procedure

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters

Academic literature on the topic 'Tableaux-based decision procedure'

Author: Grafiati
Published: 11 March 2023
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Tableaux-based decision procedure.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Tableaux-based decision procedure"

1

Huang, Jian, Xinye Zhao та Jianxing Gong. "Optimised ExpTime Tableaux for𝒮ℋℐ𝒩over Finite Residuated Lattices". Journal of Applied Mathematics 2014 (2014): 1–15. http://dx.doi.org/10.1155/2014/702326.

Full text
Abstract:
This study proposes to adopt a novel tableau reasoning algorithm for the description logic𝒮ℋℐ𝒩with semantics based on a finite residuated De Morgan lattice. The syntax, semantics, and logical properties of this logic are given, and a sound, complete, and terminating tableaux algorithm for deciding fuzzy ABox consistency and concept satisfiability problem with respect to TBox is presented. Moreover, based on extended and/or completion-forest with a series of sound optimization technique for checking satisfiability with respect to a TBox in the logic, a new optimized ExpTime (complexity-optimal)
APA, Harvard, Vancouver, ISO, and other styles
2

Özdemir, Zafer. "Tableaux approach for contact logics interpreted over intervals." Reports on Mathematical Logic 58 (December 2023): 3–13. http://dx.doi.org/10.4467/20842589rm.23.001.18800.

Full text
Abstract:
Contact logics are modal logic that is developed for reasoning about region-based theories of space. We develope a tableaux approach for contact logics interpreted over intervals (CLIOI) on the reals. For obtaining sound and complete tableaux-based decision procedures, the main technical tool is the semantic tableaux approach. We use intensively the following concepts: tableaux methods, termination of tableaux methods, saturated tableaux, termination theorem, soundness theorem, truth lemma, and completeness theorem.
APA, Harvard, Vancouver, ISO, and other styles
3

del Cerro, Luis Fariñas, and Olivier Gasquet. "Tableaux Based Decision Procedures for Modal Logics of Confluence and Density." Fundamenta Informaticae 40, no. 4 (1999): 317–33. http://dx.doi.org/10.3233/fi-1999-40401.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Balbiani, Philippe, Çiğdem Gencer, and Zafer Özdemir. "Two decision problems in Contact Logics." Logic Journal of the IGPL 27, no. 1 (2018): 8–32. http://dx.doi.org/10.1093/jigpal/jzy016.

Full text
Abstract:
Abstract Contact Logics provide a natural framework for representing and reasoning about regions in several areas of computer science. In this paper, we focus our attention on reasoning methods for Contact Logics and address the satisfiability problem and the unifiability problem. Firstly, we give sound and complete tableaux-based decision procedures in Contact Logics and we obtain new results about the decidability/complexity of the satisfiability problem in these logics. Secondly, we address the computability of the unifiability problem in Contact Logics and we obtain new results about the u
APA, Harvard, Vancouver, ISO, and other styles
5

Brucker, Achim, Frank Rittinger, and Burkhart Wolff. "HOL-Z 2.0: A Proof Environment for Z-Specifications." JUCS - Journal of Universal Computer Science 9, no. (2) (2003): 152–72. https://doi.org/10.3217/jucs-009-02-0152.

Full text
Abstract:
We present a new proof environment for the specification language Z. The basis is a semantic representation of Z in a structure-preserving, shallow embedding in Isabelle/HOL. On top of the embedding, new proof support for the Z schema calculus and for proof structuring are developed. Thus, we integrate Z into a well-known and trusted theorem prover with advanced deduction technology such as higher-order rewriting, tableaux-based provers and arithmetic decision procedures. A further achievement of this work is the integration of our embedding into a new tool-chain providing a Z-oriented type ch
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Tableaux-based decision procedure"

1

KARAFILI, Erisa. "Deduction and algorithmic approaches to reason about risk, privacy and security in multi-agent systems." Doctoral thesis, 2014. http://hdl.handle.net/11562/696564.

Full text
Abstract:
Recentemente c'è stato un crescente interesse per la privacy e il suo controllo nei sistemi multi-agente. La necessità di condividere le informazioni e il desiderio di mantenerli privati sono due concetti in competizione , in alcuni casi anche in conflitto, che incidono sui sistemi multi-agente, in particolare nei sistemi collaborativi. Il problema principale che ho affrontato è la protezione della sicurezza nei sistemi multi-agente. In questa tesi propongo diversi approcci, che sono tutti collegati gli uni agli altri. Il primo approccio è quello algoritmico, che viene utilizzato per garantir
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Tableaux-based decision procedure"

1

Friedmann, Oliver, Markus Latte, and Martin Lange. "A Decision Procedure for CTL* Based on Tableaux and Automata." In Automated Reasoning. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14203-1_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Cerna, David. "A Tableaux-Based Decision Procedure for Multi-parameter Propositional Schemata." In Lecture Notes in Computer Science. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08434-3_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Golińska-Pilarek, Joanna, Taneli Huuskonen, and Michał Zawidzki. "Tableau-based Decision Procedure for Non-Fregean Logic of Sentential Identity." In Automated Deduction – CADE 28. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79876-5_3.

Full text
Abstract:
AbstractSentential Calculus with Identity ($$\mathsf {SCI}$$ SCI ) is an extension of classical propositional logic, featuring a new connective of identity between formulas. In $$\mathsf {SCI}$$ SCI two formulas are said to be identical if they share the same denotation. In the semantics of the logic, truth values are distinguished from denotations, hence the identity connective is strictly stronger than classical equivalence. In this paper we present a sound, complete, and terminating algorithm deciding the satisfiability of $$\mathsf {SCI}$$ SCI -formulas, based on labelled tableaux. To the
APA, Harvard, Vancouver, ISO, and other styles
4

Cerrito, Serenella, and Marta Cialdea Mayer. "A Tableaux Based Decision Procedure for a Broad Class of Hybrid Formulae with Binders." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22119-4_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Cerrito, Serenella, Amélie David, and Valentin Goranko. "Optimal Tableaux-Based Decision Procedure for Testing Satisfiability in the Alternating-Time Temporal Logic ATL+." In Automated Reasoning. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08587-6_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Schröder Lutz, Pattinson Dirk, and Hausmann Daniel. "Optimal Tableaux for Conditional Logics with Cautious Monotonicity." In Frontiers in Artificial Intelligence and Applications. IOS Press, 2010. https://doi.org/10.3233/978-1-60750-606-5-707.

Full text
Abstract:
Conditional logics capture default entailment in a modal framework in which non-monotonic implication is a first-class citizen, and in particular can be negated and nested. There is a wide range of axiomatizations of conditionals in the literature, from weak systems such as the basic conditional logic CK, which allows only for equivalent exchange of conditional antecedents, to strong systems such as Burgess' system 𝒮, which imposes the full Kraus-Lehmann-Magidor properties of preferential logic. While tableaux systems implementing the actual complexity of the logic at hand have recent
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography