Inf-datalog, modal logic and complexities

Eugénie Foustoucos; Irène Guessarian

Displaying similar documents to “Inf-datalog, modal logic and complexities”

Reasoning in Basic Description Logics and Description Logics with Modal Operators

Milenko Mosurović, Tatjana Stojanović, Ana Kaplarević-Mališić (2009)

Zbornik Radova

Similarity:

Disjunction in modal description logics.

Mosurović, Milenko (2007)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

A Layered Rule-Based Architecture for Approximate Knowledge Fusion

Barbara Dunin-Kęplicz, Linh Anh Nguyen, Andrzej Sza l as (2010)

Computer Science and Information Systems

Similarity:

A system for deduction-based formal verification of workflow-oriented software models

Radosław Klimek (2014)

International Journal of Applied Mathematics and Computer Science

Similarity:

Automated theorem proving in monadic predicate calculus

Jan Štěpán (1991)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Similarity:

Cocktail: a tool for deriving correct programs.

Michael Franssen, Harrie De Swart (2004)

RACSAM

Similarity:

Cocktail is a tool for deriving correct programs from their specifications. The present version is powerful enough for educational purposes. The tool yields support for many sorted first order predicate logic, formulated in a pure type system with parametric constants (CPTS), as the specification language, a simple While-language, a Hoare logic represented in the same CPTS for deriving programs from their specifications and a simple tableau based automated theorem prover for verifying...

Informal proofs formally checked by machine

Luigia Aiello, Mario Aiello, Giuseppe Attardi, Gianfranco Prini (1976)

Annales scientifiques de l'Université de Clermont. Mathématiques

Similarity:

How to generalize logic programming to arbitrary set of clauses.

Prešić, Slaviša B. (1997)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity: