A Proof Procedure for Hybrid Logic With Binders, Transitivity and Relation Hierarchies

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-38574-2_5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Erratum To: Extension of a Decision Procedure for a Fragment of Hybrid Logic With Binders

Journal of Automated Reasoning
Computational TheorySoftwareArtificial IntelligenceMathematics
2015English

Definability and Canonicity for Boolean Logic With a Binary Relation

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2014English

Knowledge Representation in a Proof Checker for Logic Programs

2012English

Proof Planning for First-Order Temporal Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Dynamic Logic With Binders and Its Application to the Development of Reactive Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Logic and Proof in Computer Science

Advances in Knowledge Acquisition, Transfer, and Management
English

Proof Automation for Functional Correctness in Separation Logic

Journal of Logic and Computation
ArtsHumanitiesHardwareArchitectureLogicTheoretical Computer ScienceSoftware
2014English

Expansion Nets: Proof-Nets for Propositional Classical Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Natural Deduction for Hybrid Logic

Journal of Logic and Computation
ArtsHumanitiesHardwareArchitectureLogicTheoretical Computer ScienceSoftware
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy