3470 search results - page 261 / 694 » Head-Elementary-Set-Free Logic Programs |
166
click to vote
TACS
2001
Springer
15 years 11 months ago
2001
Springer
We give a logic programming language based on Fiore, Plotkin and Turi’s binding algebras. In this language, we can use not only first-order terms but also terms involving variab...
271
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
If logic programs are interpreted over a three-valued logic, then often Kleene's strong three-valued logic with complete equivalence and Fitting's associated immediate co...
269
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
This paper specifies, via a Hoare-like logic, an interprocedural and flow sensitive (but termination insensitive) information flow analysis for object-oriented programs. Pointer a...
155
click to vote
IAT
2008
IEEE
16 years 1 months ago
2008
IEEE
In this work we introduce the first steps towards the definition of an answer set semantics for residuated logic programs with negation.
173
click to vote
IBERAMIA
2004
Springer
15 years 12 months ago
2004
Springer
The theory of multi-adjoint logic programs has been introduced as a unifying framework to deal with uncertainty, imprecise data or incomplete information. From the applicative part...