Sciweavers

111 search results - page 4 / 23
» Deductive Database Languages: Problems and Solutions
Sort
View
JELIA
1990
Springer
13 years 11 months ago
Semantic Interpretation as Higher-Order Deduction
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
Fernando C. N. Pereira
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
13 years 12 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
MFDBS
1989
102views Database» more  MFDBS 1989»
13 years 11 months ago
Transitive Closure and the LOGA+-Strategy for its Efficient Evaluation
One of the key problems when extending relational database query languages to include deductive capabilities, is to provide them with efficient methods for answering recursive que...
W. Yan, Nelson Mendonça Mattos
APLAS
2005
ACM
14 years 1 months ago
Using Datalog with Binary Decision Diagrams for Program Analysis
Many problems in program analysis can be expressed naturally and concisely in a declarative language like Datalog. This makes it easy to specify new analyses or extend or compose e...
John Whaley, Dzintars Avots, Michael Carbin, Monic...
ESWS
2008
Springer
13 years 9 months ago
Numeric reasoning in the Semantic Web
Abstract. The Semantic Web is an effort by the W3C to enable integration and sharing of information across different applications and organizations using annotations by means of on...
Chimène Fankam, Stéphane Jean, Guy P...