Sciweavers

181 search results - page 22 / 37
» New Inference Rules for Max-SAT
Sort
View
WFLP
2009
Springer
239views Algorithms» more  WFLP 2009»
14 years 2 months ago
Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
Michael Leuschel, Salvador Tamarit, Germán ...
COGSCI
2010
87views more  COGSCI 2010»
13 years 6 months ago
The Logical Problem of Language Acquisition: A Probabilistic Perspective
Natural language is full of patterns that appear to fit with general linguistic rules but are ungrammatical. There has been much debate over how children acquire these ‘‘ling...
Anne S. Hsu, Nick Chater
SIGMOD
2004
ACM
160views Database» more  SIGMOD 2004»
14 years 7 months ago
Extending Query Rewriting Techniques for Fine-Grained Access Control
Current day database applications, with large numbers of users, require fine-grained access control mechanisms, at the level of individual tuples, not just entire relations/views,...
Shariq Rizvi, Alberto O. Mendelzon, S. Sudarshan, ...
ASE
2002
141views more  ASE 2002»
13 years 7 months ago
On the Automatic Recovery of Style-Specific Architectural Relations in Software Systems
The cost of maintaining a software system over a long period of time far exceeds its initial development cost. Much of the maintenance cost is attributed to the time required by ne...
Martin Traverso, Spiros Mancoridis
CSL
2007
Springer
14 years 1 months ago
A Cut-Free and Invariant-Free Sequent Calculus for PLTL
Abstract. Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goa...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...