SLDNFA-system

03/08/2000
by   Bert Van Nuffelen, et al.
0

The SLDNFA-system results from the LP+ project at the K.U.Leuven, which investigates logics and proof procedures for these logics for declarative knowledge representation. Within this project inductive definition logic (ID-logic) is used as representation logic. Different solvers are being developed for this logic and one of these is SLDNFA. A prototype of the system is available and used for investigating how to solve efficiently problems represented in ID-logic.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/08/2000

Problem solving in ID-logic with aggregates: some experiments

The goal of the LP+ project at the K.U.Leuven is to design an expressive...
research
07/11/2012

LPC(ID): A Sequent Calculus Proof System for Propositional Logic Extended with Inductive Definitions

The logic FO(ID) uses ideas from the field of logic programming to exten...
research
03/27/2013

Lp : A Logic for Statistical Information

This extended abstract presents a logic, called Lp, that is capable of r...
research
12/20/2013

Negation in the Head of CP-logic Rules

CP-logic is a probabilistic extension of the logic FO(ID). Unlike ASP, b...
research
10/09/2019

A Query-Driven Decision Procedure for Distributed Autoepistemic Logic with Inductive Definitions

Distributed Autoepistemic Logic with Inductive Definitions (dAEL(ID)) is...
research
04/14/2022

Mortensen Logics

Mortensen introduced a connexive logic commonly known as 'M3V'. M3V is o...
research
07/09/2018

AI Reasoning Systems: PAC and Applied Methods

Learning and logic are distinct and remarkable approaches to prediction....

Please sign up or login with your details

Forgot password? Click here to reset