Sciweavers

51 search results - page 9 / 11
» The Importance of Rule Restrictions in CCG
Sort
View
99
Voted
PPDP
2010
Springer
14 years 8 months ago
Type inference in intuitionistic linear logic
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
Patrick Baillot, Martin Hofmann
90
Voted
SAT
2007
Springer
118views Hardware» more  SAT 2007»
15 years 3 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
IMC
2007
ACM
14 years 11 months ago
Legal issues surrounding monitoring during network research
This work was motivated by a discussion that two of the coauthors (computer science professors) had with the other coauthor (a law professor and a former computer crime Trial Atto...
Douglas C. Sicker, Paul Ohm, Dirk Grunwald
PVLDB
2010
151views more  PVLDB 2010»
14 years 8 months ago
Advanced Processing for Ontological Queries
Ontology-based data access is a powerful form of extending database technology, where a classical extensional database (EDB) is enhanced by an ontology that generates new intensio...
Andrea Calì, Georg Gottlob, Andreas Pieris
SIGSOFT
2008
ACM
15 years 10 months ago
Javert: fully automatic mining of general temporal properties from dynamic traces
Program specifications are important for many tasks during software design, development, and maintenance. Among these, temporal specifications are particularly useful. They expres...
Mark Gabel, Zhendong Su