Computability logic

Computability logic (CoL) is a research program and mathematical framework for redeveloping logic as a systematic formal theory of computability, as…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

One problem on logic programming is to express exception handling. We argue that this problem can be solved by adopting linear…

2015

The class of first-order Hereditary Harrop formulas ($fohh$) is a well-established extension of first-order Horn clauses. Its…

2015

Inductions and game semantics are two useful extensions to traditional logic programming. To be specific, inductions can capture…

2015

Logic programming with fixed-point definitions is a useful extension of traditional logic programming. Fixed-point definitions…

2015

In this paper, we present two new forms of the $write$ statement: one of the form $write(x);G$ where $G$ is a statement and the…

2015

Logic programming with fixed-point definitions is a useful extension of traditional logic programming. Fixed-point definitions…

2013

Gurevich and Rabinovich raised the following question: given a property of a set of rational numbers definable in the real line…

2013

Adding interaction to logic programming is an essential task. Expressive logics such as linear logic provide a theoretical basis…

2010

2009

Based on the sound and complete subset CL4 of computability logic,knowledge representation is discussed by dividing knowledge…