4573 search results - page 844 / 915 » Automated Reasoning |
105
click to vote
WWW
2007
ACM
16 years 17 days ago
2007
ACM
Syndication systems on the Web have attracted vast amounts of attention in recent years. As technologies have emerged and matured, there has been a transition to more expressive s...
173
click to vote
ICLP
2009
Springer
16 years 16 days ago
2009
Springer
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
112
click to vote
CADE
2009
Springer
16 years 15 days ago
2009
Springer
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
101
click to vote
CADE
2007
Springer
16 years 5 days ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
104
click to vote
CADE
2005
Springer
16 years 5 days ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...