Sciweavers

1670 search results - page 44 / 334
» On Skolemization in constructive theories
Sort
View
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 9 months ago
Bistable Biorders: A Sequential Domain Theory
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
James Laird
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
14 years 10 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
ICFP
2003
ACM
14 years 9 months ago
A theory of aspects
This paper define the semantics of MinAML, an idealized aspect-oriented programming language, by giving a typedirected translation from its user-friendly external language to its ...
David Walker, Steve Zdancewic, Jay Ligatti
FSTTCS
2001
Springer
14 years 2 months ago
Rewrite Closure for Ground and Cancellative AC Theories
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
Ashish Tiwari
RSCTC
2000
Springer
147views Fuzzy Logic» more  RSCTC 2000»
14 years 1 months ago
Towards Rough Neural Computing Based on Rough Membership Functions: Theory and Application
This paper introduces a neural network architecture based on rough sets and rough membership functions. The neurons of such networks instantiate approximate reasoning in assessing ...
James F. Peters, Andrzej Skowron, Liting Han, Shee...