Sciweavers

111 search results - page 17 / 23
» The eskolemization of universal quantifiers
Sort
View
ICLP
1991
Springer
13 years 11 months ago
{log}: A Logic Programming Language with Finite Sets
An extended logic programming language embodying sets is developed in successive stages, introducing at each stage simple set dictions and operations, and discussing their operati...
Agostino Dovier, Eugenio G. Omodeo, Enrico Pontell...
CSL
2008
Springer
13 years 9 months ago
Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars
Abstract. We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by ch...
Ruzica Piskac, Viktor Kuncak
PDPTA
2007
13 years 9 months ago
Web Server Traffic Characterization at the UFL College of Design, Construction, and Planning
- Our study evaluates user (Web browser) accesses to a Web server. We examine a Web server log that was collected for the span of several months at the College of Design, Construct...
Zornitza Genova Prodanoff, Karen Cano
CSREAESA
2006
13 years 9 months ago
Reliable Management Services for COTS-based Space Systems and Applications
Hybrid spacecraft processing platforms that combine radiation-hardened components with commercialgrade COTS components have the potential to dramatically improve performance while ...
Ian A. Troxel, Eric Grobelny, Grzegorz Cieslewski,...
CORR
2008
Springer
83views Education» more  CORR 2008»
13 years 8 months ago
Alternating Hierarchies for Time-Space Tradeoffs
Nepomnjascii's Theorem states that for all 0 < 1 and k > 0 the class of languages recognized in nondeterministic time nk and space n , NTISP[nk , n ], is contained in ...
Chris Pollett, Eric Miles