Sciweavers

6618 search results - page 241 / 1324
» Natural Logic for Natural Language
Sort
View
BIRTHDAY
1991
Springer
15 years 10 months ago
Modal Logic Should Say More Than It Does
First-order modal logics, as traditionally formulated, are not expressive enough. It is this that is behind the difficulties in formulating a good analog of Herbrand’s Theorem, ...
Melvin Fitting
TABLEAUX
2009
Springer
16 years 1 months ago
Modular Sequent Systems for Modal Logic
We see cut-free sequent systems for the basic normal modal logics formed by any combination the axioms d, t, b, 4, 5. These systems are modular in the sense that each axiom has a c...
Kai Brünnler, Lutz Straßburger
FOCS
1989
IEEE
15 years 10 months ago
A Really Temporal Logic
We introduce a temporal logic for the speci cation of real-time systems. Our logic, TPTL, employs a novel quanti er construct for referencing time: the freeze quanti er binds a var...
Rajeev Alur, Thomas A. Henzinger
LFCS
2009
Springer
16 years 1 months ago
Completeness Results for Memory Logics
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structure...
Carlos Areces, Santiago Figueira, Sergio Mera
ADC
2008
Springer
146views Database» more  ADC 2008»
16 years 1 months ago
A Typed Higher-Order Calculus for Querying XML Databases
As the eXtensible Markup Language (XML) is about to emerge as a new standard for databases, the problem of providing solid logical grounds for XML query languages arises. For the ...
Qing Wang, Klaus-Dieter Schewe