Sciweavers

76 search results - page 3 / 16
» A Tabulation Proof Procedure for Residuated Logic Programmin...
Sort
View
NGC
2000
Springer
124views Communications» more  NGC 2000»
13 years 8 months ago
Temporal Disjunctive Logic Programming
In this paper we introduce the logic programminglanguage Disjunctive Chronolog which combines the programming paradigms of temporal and disjunctive logic programming. Disjunctive C...
Manolis Gergatsoulis, Panos Rondogiannis, Themis P...
LOGCOM
2010
152views more  LOGCOM 2010»
13 years 3 months ago
Constructive Logic with Strong Negation as a Substructural Logic
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
Manuela Busaniche, Roberto Cignoli
PLDI
2009
ACM
14 years 9 months ago
A decision procedure for subset constraints over regular languages
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
Pieter Hooimeijer, Westley Weimer
LOPSTR
2000
Springer
14 years 3 days ago
A formal framework for synthesis and verification of logic programs
In this paper we will present a formal framework, based on the notion of extraction calculus, which has been successfully applied to define procedures for extracting information fr...
Alessandro Avellone, Mauro Ferrari, Camillo Fioren...
FSTTCS
2004
Springer
14 years 1 months ago
A Decidable Fragment of Separation Logic
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn