Add to ORKGThe author considers the model-theoretic character of proofs and disproofs by means of attempted counterexample constructions, distinguishes this proof format from formal derivations, then contrasts two approaches to semantic tableaux proposed by Beth and Lambert-van Fraassen. It is noted that Beth's original approach has not as yet been provided with a precisely formulated rule of closure for detecting tableau sequences terminating in contradiction. To remedy this deficiency, a technique is proposed to clarify tableau operations
Abstract. Description logics are a family of knowledge representation formalisms that are descended ...
The tableaux-constructions have a number of properties which ad-vantageously distinguish them from e...
International audienceMemory logics are modal logics whose semantics is specified in terms of relati...
The author considers the model-theoretic character of proofs and disproofs by means of att...
A family of tableau methods, called ordered semantic hyper (OSH) tableau methods for first-order the...
We present a set of seminar notes on basic concepts and results on automated and semiautomated verif...
International audienceIn this paper we study formal tools for the definition of tableaux systems for...
Abstract. We present an approach for studying logical properties of problemsolving methods (PSMs) fo...
Abstract. Our interest in this paper are semantic tableau approaches closely related to bottom-up mo...
The paper is devoted to an approach to analytic tableaux for propositional logic, but can be success...
Introduction: Semantic tableaux are a method for determining validity of arguments in a certain clas...
Axiom pinpointing has been introduced in description logics (DLs) to help the used understand the re...
This paper presents a method for synthesising sound and complete tableaucalculi. Given a specificati...
Axiom pinpointing has been introduced in description logics (DLs) to help the used understand the re...
We show that Smullyan's analytic tableaux cannot p-simulate the truth-tables. We identify the c...
Abstract. Description logics are a family of knowledge representation formalisms that are descended ...
The tableaux-constructions have a number of properties which ad-vantageously distinguish them from e...
International audienceMemory logics are modal logics whose semantics is specified in terms of relati...
The author considers the model-theoretic character of proofs and disproofs by means of att...
A family of tableau methods, called ordered semantic hyper (OSH) tableau methods for first-order the...
We present a set of seminar notes on basic concepts and results on automated and semiautomated verif...
International audienceIn this paper we study formal tools for the definition of tableaux systems for...
Abstract. We present an approach for studying logical properties of problemsolving methods (PSMs) fo...
Abstract. Our interest in this paper are semantic tableau approaches closely related to bottom-up mo...
The paper is devoted to an approach to analytic tableaux for propositional logic, but can be success...
Introduction: Semantic tableaux are a method for determining validity of arguments in a certain clas...
Axiom pinpointing has been introduced in description logics (DLs) to help the used understand the re...
This paper presents a method for synthesising sound and complete tableaucalculi. Given a specificati...
Axiom pinpointing has been introduced in description logics (DLs) to help the used understand the re...
We show that Smullyan's analytic tableaux cannot p-simulate the truth-tables. We identify the c...
Abstract. Description logics are a family of knowledge representation formalisms that are descended ...
The tableaux-constructions have a number of properties which ad-vantageously distinguish them from e...
International audienceMemory logics are modal logics whose semantics is specified in terms of relati...