Sciweavers

1054 search results - page 37 / 211
» A Logic Language of Granular Computing
Sort
View
FOSSACS
2005
Springer
14 years 1 months ago
A Simpler Proof Theory for Nominal Logic
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
James Cheney
TCS
2008
13 years 7 months ago
Fine hierarchies and m-reducibilities in theoretical computer science
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
Victor L. Selivanov
PODS
2000
ACM
102views Database» more  PODS 2000»
14 years 10 days ago
Linear Approximation of Planar Spatial Databases Using Transitive-Closure Logic
We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate line...
Floris Geerts, Bart Kuijpers
RTA
2010
Springer
13 years 12 months ago
A Rewriting Logic Semantics Approach to Modular Program Analysis
The K framework, based on rewriting logic semantics, provides a powerful logic for defining the semantics of programming languages. While most work in this area has focused on de...
Mark Hills, Grigore Rosu
AO
2007
80views more  AO 2007»
13 years 8 months ago
Problems in the ontology of computer programs
As a first step in the larger project of charting the ontology of computer programs, we pose three central questions: (1) Can programs, hardware, and metaprograms be organized into...
Amnon H. Eden, Raymond Turner