1268 search results - page 25 / 254 » One Logic to Use Them All |
CSL
2009
Springer
14 years 1 months ago
2009
Springer
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
SIGLEX
1991
14 years 1 months ago
1991
The lexical entry for a word must contain all the information needed to construct a semantic representation for sentences that contain the word. Because of that requirement, the f...
ICLP
2010
Springer
14 years 1 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
DAC
1996
ACM
14 years 2 months ago
1996
ACM
Technology mapping requires the unmapped logic network to be represented in terms of base functions, usually two-input NORs and inverters. Technology decomposition is the step tha...
DIMACS
1996
13 years 11 months ago
1996
: We review the expressibility of some basic graph properties in certain fragments of Monadic Second-Order logic, like the set of Monadic-NP formulas. We focus on cases where a pro...