338 search results - page 33 / 68 » Soundness and Completeness of a Logic Programming Approach t... |
TABLEAUX
2009
Springer
14 years 2 months ago
2009
Springer
We define a notion of formula schema handling arithmetic parameters, indexed propositional variables (e.g. Pi) and iterated conjunctions/disjunctions (e.g. Vn i=1 Pi, where n is a...
KR
2004
Springer
14 years 1 months ago
2004
Springer
The goal of producing a general purpose, semantically motivated, and computationally tractable deductive reasoning service remains surprisingly elusive. By and large, approaches t...
FSTTCS
2007
Springer
14 years 1 months ago
2007
Springer
There are two somewhat contradictory ways of looking at modules in a given programming language. On the one hand, module systems are largely independent of the particulars of progr...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
The probability theory is a well-studied branch of mathematics, in order to carry out formal reasoning about probability. Thus, it is important to have a logic, both for computati...
LOGCOM
1998
13 years 7 months ago
1998
A sequent calculus of a new sort is extracted from the Prolog program leanTAP. This calculus is sound and complete, even though it lacks almost all structural rules. Thinking of l...