Decision procedures for stratified set-theoretic syllogistics

Interval logics and their decision procedures Part II: A real-time interval logic

Theoretical Computer Science ◽

10.1016/s0304-3975(96)00255-1 ◽

1996 ◽

Vol 170 (1-2) ◽

pp. 1-46 ◽

Cited By ~ 4

Author(s):

Y Ramakrishna

Keyword(s):

Real Time ◽

Decision Procedures ◽

Time Interval ◽

Interval Logic

Download Full-text

Monotonic and Non-Monotonic Logics of Knowledge1

Fundamenta Informaticae ◽

10.3233/fi-1991-153-405 ◽

1991 ◽

Vol 15 (3-4) ◽

pp. 255-274

Author(s):

Rohit Parikh

Keyword(s):

Model Theory ◽

Decision Procedures ◽

Logic Of Knowledge

We study monotonic and non-monotonic Logics of Knowledge, giving decision procedures and completeness results. In particular we develop a model theory for a non-monotonic Logic of Knowledge and show that it corresponds exactly to normal applications of a non-monotonic rule of inference due to McCarthy.

Download Full-text

An Improved Set-based Reasoner for the Description Logic 𝒟ℒD4,×†

Fundamenta Informaticae ◽

10.3233/fi-2021-2009 ◽

2021 ◽

Vol 178 (4) ◽

pp. 315-346

Author(s):

Domenico Cantone ◽

Marianna Nicolosi-Asmundo ◽

Daniele Francesco Santamaria

Keyword(s):

Semantic Web ◽

Set Theory ◽

Description Logic ◽

Knowledge Bases ◽

Query Answering ◽

Conjunctive Query ◽

Classification Problems ◽

Previous Version ◽

Decidable Fragment ◽

Stratified Set

We present a KE-tableau-based implementation of a reasoner for a decidable fragment of (stratified) set theory expressing the description logic 𝒟ℒ〈4LQSR,×〉(D) (𝒟ℒD4,×, for short). Our application solves the main TBox and ABox reasoning problems for 𝒟ℒD4,×. In particular, it solves the consistency and the classification problems for 𝒟ℒD4,×-knowledge bases represented in set-theoretic terms, and a generalization of the Conjunctive Query Answering problem in which conjunctive queries with variables of three sorts are admitted. The reasoner, which extends and improves a previous version, is implemented in C++. It supports 𝒟ℒD4,×-knowledge bases serialized in the OWL/XML format and it admits also rules expressed in SWRL (Semantic Web Rule Language).

Download Full-text

Deciding Clause Classes by Semantic Clash Resolution

Fundamenta Informaticae ◽

10.3233/fi-1993-182-406 ◽

1993 ◽

Vol 18 (2-4) ◽

pp. 163-182

Author(s):

Alexander Leitsch

Keyword(s):

Decision Procedure ◽

Decision Procedures ◽

General Concept ◽

Complexity Measure ◽

Syntactical Structure

It is investigated, how semantic clash resolution can be used to decide some classes of clause sets. Because semantic clash resolution is complete, the termination of the resolution procedure on a class Γ gives a decision procedure for Γ. Besides generalizing earlier results we investigate the relation between termination and clause complexity. For this purpose we define the general concept of atom complexity measure and show some general results about termination in terms of such measures. Moreover, rather than using fixed resolution refinements we define an algorithmic generator for decision procedures, which constructs appropriate semantic refinements out of the syntactical structure of the clause sets. This method is applied to the Bernays – Schönfinkel class, where it gives an efficient (resolution) decision procedure.

Download Full-text

Are there similarities between the Corona and the climate crisis?

Journal of Environmental Studies and Sciences ◽

10.1007/s13412-021-00666-5 ◽

2021 ◽

Author(s):

Robert C. Schmidt

Keyword(s):

Climate Change ◽

Political Parties ◽

Decision Procedures ◽

Free Rider ◽

Decision Makers ◽

Short Paper ◽

Political Decision ◽

Look Back ◽

Policy Measures ◽

Climate Crisis

AbstractIn this short paper, I look back at the early stages of the Corona crisis, around early February 2020, and compare the situation with the climate crisis. Although these two problems unfold on a completely different timescale (weeks in the case of Corona, decades in the case of climate change), I find some rather striking similarities between these two problems, related with issues such as uncertainty, free-rider incentives, and disincentives of politicians to adequately address the respective issue with early, farsighted and possibly harsh policy measures. I then argue that for complex problems with certain characteristics, it may be necessary to establish novel political decision procedures that sidestep the normal, day-to-day political proceedings. These would be procedures that actively involve experts, and lower the involvement of political parties as far as possible to minimize the decision-makers’ disincentives.

Download Full-text