Sciweavers

393 search results - page 32 / 79
» Logic Programs with Classical Negation
Sort
View
CORR
2007
Springer
116views Education» more  CORR 2007»
14 years 9 months ago
A presentation of Quantum Logic based on an "and then" connective
When a physicist performs a quantic measurement, new information about the system at hand is gathered. This presentation studies the logical properties of how this new information...
Daniel Lehmann
LPNMR
2007
Springer
15 years 3 months ago
Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
Joohyung Lee, Ravi Palla
SAS
2001
Springer
116views Formal Methods» more  SAS 2001»
15 years 2 months ago
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
Frédéric Mesnard, Ulrich Neumerkel
AGP
1993
IEEE
15 years 1 months ago
A Note on Logic Programming Fixed-Point Semantics
In this paper, we present an account of classical Logic Programming fixed-point semantics in terms of two standard categorical constructions in which the least Herbrand model is ...
Vladimiro Sassone
PLPV
2009
ACM
15 years 6 months ago
Positively dependent types
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
Daniel R. Licata, Robert Harper