Restricted Predicates for Hypothetical Datalog

12/22/2015
by   Fernando Sáenz-Pérez, et al.
0

Hypothetical Datalog is based on an intuitionistic semantics rather than on a classical logic semantics, and embedded implications are allowed in rule bodies. While the usual implication (i.e., the neck of a Horn clause) stands for inferring facts, an embedded implication plays the role of assuming its premise for deriving its consequence. A former work introduced both a formal framework and a goal-oriented tabled implementation, allowing negation in rule bodies. While in that work positive assumptions for both facts and rules can occur in the premise, negative assumptions are not allowed. In this work, we cover this subject by introducing a new concept: a restricted predicate, which allows negative assumptions by pruning the usual semantics of a predicate. This new setting has been implemented in the deductive system DES.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/20/2016

Founded Semantics and Constraint Semantics of Logic Rules

This paper describes a simple new semantics for logic rules, founded sem...
research
09/14/2017

Extending Coinductive Logic Programming with Co-Facts

We introduce a generalized logic programming paradigm where programs, co...
research
05/10/2022

Reasoning in the Description Logic ALC under Category Semantics

We present in this paper a reformulation of the usual set-theoretical se...
research
03/06/2022

The Orthologic of Epistemic Modals

Epistemic modals have peculiar logical features that are challenging to ...
research
01/07/2022

Stay Positive: Knowledge Graph Embedding Without Negative Sampling

Knowledge graphs (KGs) are typically incomplete and we often wish to inf...
research
08/19/2019

Why So Down? The Role of Negative (and Positive) Pointwise Mutual Information in Distributional Semantics

In distributional semantics, the pointwise mutual information (PMI) weig...

Please sign up or login with your details

Forgot password? Click here to reset