Sciweavers

3470 search results - page 17 / 694
» Head-Elementary-Set-Free Logic Programs
Sort
View
AMAI
2006
Springer
13 years 10 months ago
Strong order equivalence
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively and were shown to be beneficial for modular programming and automated optimizati...
Wolfgang Faber, Kathrin Konczak
ENTCS
2010
105views more  ENTCS 2010»
13 years 10 months ago
From Focalization of Logic to the Logic of Focalization
Focalization property is a deep outcome of linear logic proof theory, putting to the foreground the role of polarity in logic. It resulted an important advances in various fields, ...
Michele Basaldella, Alexis Saurin, Kazushige Terui
LOPSTR
1997
Springer
14 years 2 months ago
Implicit Program Synthesis by a Reversible Metainterpreter
Synthesis of logic programs is considered as a special instance of logic programming. We describe experience made within a logical metaprogramming environment whose central compone...
Henning Christiansen
MPC
2000
Springer
113views Mathematics» more  MPC 2000»
14 years 1 months ago
Proving Pointer Programs in Hoare Logic
It is possible, but difficult, to reason in Hoare logic about programs which address and modify data structures defined by pointers. The challenge is to approach the simplicity of ...
Richard Bornat
PPDP
2010
Springer
13 years 8 months ago
Permissive-nominal logic
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...
Gilles Dowek, Murdoch James Gabbay