BDD-based reasoning in the fluent calculus - first results

03/09/2000
by   Steffen Hoelldobler, et al.
0

The paper reports on first preliminary results and insights gained in a project aiming at implementing the fluent calculus using methods and techniques based on binary decision diagrams. After reporting on an initial experiment showing promising results we discuss our findings concerning various techniques and heuristics used to speed up the reasoning process.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/08/2018

A New Algorithmic Decision for Categorical Syllogisms via Caroll's Diagrams

In this paper, we deal with a calculus system SLCD (Syllogistic Logic wi...
research
12/05/2018

Gems of Corrado Böhm

The main scientific heritage of Corrado Böhm is about computing, both co...
research
04/16/2018

Trees from Functions as Processes

Levy-Longo Trees and Bohm Trees are the best known tree structures on th...
research
03/11/2021

Classifying Complexity with the ZX-Calculus: Jones Polynomials and Potts Partition Functions

The ZX-calculus is a graphical language which allows for reasoning about...
research
12/14/2018

Computational interpretations of classical reasoning: From the epsilon calculus to stateful programs

The problem of giving a computational meaning to classical reasoning lie...
research
10/01/2018

Handling Nominals and Inverse Roles using Algebraic Reasoning

This paper presents a novel SHOI tableau calculus which incorporates alg...
research
06/23/2021

Reporting Revenge Porn: a Preliminary Expert Analysis

In our research, we focus on the response to the non-consensual distribu...

Please sign up or login with your details

Forgot password? Click here to reset