Imagen de Portada

(Hyper)sequent Calculi for the ALC(S4) Description Logics

Fuente: Redalyc

Guardado en:

Detalles Bibliográficos
Autor principal:	Juan Pablo Muñoz
Formato:	Artículo científico
Lenguaje:	en
Publicado:	Instituto Politécnico Nacional 2016
Materias:	Computación proof theory (Hyper)sequents Description logics automated reasoning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

More efficient proof-search for sequents of temporal logic
por: Romas Alonderis
Publicado: (2022)

Automated Reasoning with Analytic Tableaux and Related Methods
Publicado: (2023)

Expanding the Universe of Universal Logic
por: James Trafford
Publicado: (2014)

Automated Deduction – CADE 29
Publicado: (2023)

General Theory of Finite Descent Authority
por: Carroll, Jeremy H.
Publicado: (2026)

A Counting Logic for Trees
por: Everardo Bárcenas
Publicado: (2015)

The Hyper-Reality AGI Series
por: Universal Codex Sytems and Solutions, et al.
Publicado: (2025)

Proof Engine Verification (PROVED): Training and running today's frontier AI models consumes more electricity than entire small countries.
por: Proof Engine
Publicado: (2026)

Claim Verification: "GLP-1 drugs like Ozempic cause unavoidable major muscle loss and "Ozempic face" even with exercise and high protein intake" — Disproved
por: Proof Engine
Publicado: (2026)

Claim Verification: "The Pyramid of Giza was built by slaves." — Disproved
por: Proof Engine
Publicado: (2026)

Claim Verification: "AI hallucinations occur on fewer than 5% of factual questions" — Disproved
por: Proof Engine
Publicado: (2026)

Some implications of an epistemic-intersubjective interpretation of the “beyond all reasonable doubt” standard of proof for criminal investigations
por: Edgar R. Aguilera
Publicado: (2020)

The First Rule of Stoic Logic and its Relationship with the Indemonstrables
por: Miguel López-Astorga
Publicado: (2016)

Claim Verification: "The binary operator eml is defined by the expression \(\text{eml}(a, b) = \exp(a) - \ln(b)\) (where exp is the exponential function and ln is the principal branch of the natural logarithm). For every real \(x > 0\), the nested expression \(\text{eml}(1, \text{eml}(\text{eml}(1, x), 1))\) equals the natural logarithm \(\ln(x)\)." — Proved
por: Proof Engine
Publicado: (2026)

Claim Verification: "The binary operator eml is defined by the expression \(\text{eml}(a, b) = \exp(a) - \ln(b)\). There exists a finite binary tree consisting solely of eml operations, whose 9 leaves are drawn from \(\{1, x, y\}\), such that the tree evaluates exactly to \(x \times y\). The tree has K = 17 tokens (8 eml operations and 9 leaves), and the identity holds for all complex \(x\) and \(y\) (in the algebraic setting where \(\ln \circ \exp\) is the identity)." — Proved
por: Proof Engine
Publicado: (2026)

Claim Verification: "Quantum entanglement enables the transmission of usable information faster than the speed of light when the distant parties pre-agree on a measurement basis." — Disproved
por: Proof Engine
Publicado: (2026)

A Logic Programming Approach to the Conservation of Buildings Based on an Extension of the Eindhoven Classification Model
por: Guida Gomes
Publicado: (2013)

Tableau Methods for Propositional Logic and Term Logic
por: Jarmużek, Tomasz
Publicado: (2024)

Artifact of the paper 'Compiling Classical Sequent Calculus to Stock Hardware: The Duality of Compilation'
por: Schuster, Philipp, et al.
Publicado: (2025)

Building General Hyper-Heuristics for Multi-Objective Cutting Stock Problems
por: Juan Carlos Gómez
Publicado: (2012)

Informal Logic
Publicado: (2008)

Remarks on the Idea of Non-monotonic (Diagrammatic) Inference
por: J. Martín Castro-Manzano
Publicado: (2017)

A Finite–Depth Structural Resolution of the Collatz Conjecture via Hierarchical Height Functions and Mother Chains (JNT Submission Version)
por: Matsuua, Yoshihito
Publicado: (2025)

Reasoning with Inconsistent Possibilistic Ontologies byApplying Argument Accrual
por: Sergio Alejandro Gómez
Publicado: (2017)

retracted
por: Fathi, Kevin
Publicado: (2025)

Automated Reasoning
Publicado: (2024)

Automated Reasoning
Publicado: (2024)

LETTER FROM THE EDITORS
por: Andoni Ibarra
Publicado: (2016)

Illustrating a neural model of logic computations: The case of Sherlock Holmes’ old maxim
por: Eduardo Mizraji
Publicado: (2016)

Frontiers of Combining Systems
Publicado: (2023)

INAF.Libraries.Net.HyperLab.CommonHelpers TECHNICAL REPORT
por: Carraro, Francesco
Publicado: (2026)

Automated Reasoning with Analytic Tableaux and Related Methods
Publicado: (2025)

A Preliminary Reification of Argument Theory Change
por: Nicolás D. Rotstein
Publicado: (2008)

CONDITIONALS AND DISJUNCTIONS IN MENTAL-LOGIC THEORY: A RESPONSE TO LIU AND CHOU (2012) AND TO LÓPEZ ASTORGA (2013)
por: David P. O’Brien
Publicado: (2014)

Factors propelling mathematics learning: insights from a quantitative empirical study
por: Popova, Yuliya, et al.
Publicado: (2024)

A PROPOSAL OF T-LEARNING: USING ARTIFICIAL INTELLIGENCE PLANNING AND ONTOLOGICAL REASONING
por: Ingrid-Durley Torres-Pardo
Publicado: (2013)

An Implementation of Propositional Logic Resolution Applying a Novel Specific Algebra
por: Eduardo Zurek
Publicado: (2015)

Phase Transition of Logic: Experimental Observation of Logical Collapse in Transformer Hidden Spaces
por: Wang, Zhongren
Publicado: (2025)

A Completeness of Metrics for Topological Relations in 3D Qualitative Spatial Reasoning
por: Chaman L. Sabharwal
Publicado: (2015)

HyperFuzzy and SuperHyperFuzzy Group Decision-Making
por: Fujita, Takaaki
Publicado: (2025)