835 search results - page 35 / 167 » Geometric Logic in Computer Science |
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
SOFSEM
1998
Springer
14 years 26 days ago
1998
Springer
In our paper we discuss an approach to semiautomatic corpus processing aimed at analysing verb valencies in Czech and consecutive determining the type of TIL (Transparent Intension...
CSR
2006
Springer
14 years 10 days ago
2006
Springer
Abstract. We prove a conjecture by A. Pnueli and strengthen it showing a sequence of "counting modalities" none of which is expressible in the temporal logic generated by...
AO
2007
13 years 8 months ago
2007
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...
MFCS
1998
Springer
14 years 26 days ago
1998
Springer
We develop a control flow analysis for the Imperative Object Calculus. We prove the correctness with respect to two Structural Operational Semantics that differ in minor technical ...