Bibliografías temáticas / Tableaux-based decision procedure

Índice

  1. Artículos de revistas
  2. Capítulos de libros

Literatura académica sobre el tema "Tableaux-based decision procedure"

Autor: Grafiati
Publicado: 11 de marzo de 2023

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Tableaux-based decision procedure".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Artículos de revistas sobre el tema "Tableaux-based decision procedure"

1

Huang, Jian, Xinye Zhao y 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.

Texto completo
Resumen
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) tableau decision procedure is presented here. The experimental evaluation indicates that the optimization techniques we considered result in improved efficiency significantly.
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

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

Texto completo
Resumen
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 unification type of the unifiability problem in these logics.
Los estilos APA, Harvard, Vancouver, ISO, etc.

Capítulos de libros sobre el tema "Tableaux-based decision procedure"

1

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

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

Texto completo
Resumen
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 best of our knowledge, it is the first implemented decision procedure for $$\mathsf {SCI}$$ SCI which runs in NP, i.e., is complexity-optimal. The obtained complexity bound is a result of dividing derivation rules in the algorithm into two sets: decomposition and equality rules, whose interplay yields derivation trees with branches of polynomial length with respect to the size of the investigated formula. We describe an implementation of the procedure and compare its performance with implementations of other calculi for $$\mathsf {SCI}$$ SCI (for which, however, the termination results were not established). We show possible refinements of our algorithm and discuss the possibility of extending it to other non-Fregean logics.
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

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

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!

Pasar a la bibliografía