Sciweavers

4126 search results - page 527 / 826
» Relationships with other Formalisms
Sort
View
LPKR
1997
Springer
15 years 10 months ago
Abduction, Argumentation and Bi-Disjunctive Logic Programs
Abstract. We study the relationship between argumentation (abduction) and disjunctive logic programming. Based on the paradigm of argumentation, an abductive semantic framework for...
Kewen Wang, Huowang Chen
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
15 years 10 months ago
Characterizing Linear Size Circuits in Terms of Privacy
In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits, and n-party private protocols. Speci...
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...
LOPSTR
1994
Springer
15 years 10 months ago
A Transformation System for Definite Programs Based on Termination Analysis
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
J. Cook, John P. Gallagher
TACS
1994
Springer
15 years 10 months ago
ML Typing, Explicit Polymorphism and Qualified Types
The ML type system was originally introduced as a means of identifying a class of terms in a simple untyped language, often referred to as core-ML, whose evaluation could be guaran...
Mark P. Jones
COCO
1990
Springer
50views Algorithms» more  COCO 1990»
15 years 10 months ago
Width-Bounded Reducibility and Binary Search over Complexity Classes
d Abstract) Eric Allender Christopher Wilson Department of Computer Science Department of Computer Rutgers University and Information Science New Brunswick, NJ 08903, USA Universit...
Eric Allender, Christopher B. Wilson