756 search results - page 12 / 152 » Using Logic Programs to Reason about Infinite Sets |
FM
2009
Springer
14 years 3 months ago
2009
Springer
Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...
ICDT
2003
ACM
14 years 1 months ago
2003
ACM
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...
WWW
2004
ACM
14 years 9 months ago
2004
ACM
The paper describes some innovations related to the ongoing work on the GSA prototype, an integrated information retrieval agent. In order to improve the original system effective...
CSL
2007
Springer
14 years 10 days ago
2007
Springer
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
ATAL
2007
Springer
14 years 2 months ago
2007
Springer
Agents that must reach agreements with other agents need to reason about how their preferences, judgments, and beliefs might be aggregated with those of others by the social choic...