Sciweavers

3446 search results - page 70 / 690
» A Reasoning Algorithm for pD*
Sort
View
CADE
2003
Springer
16 years 1 months ago
Proving Pointer Programs in Higher-Order Logic
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
Farhad Mehta, Tobias Nipkow
PPSWR
2005
Springer
15 years 7 months ago
A Geospatial World Model for the Semantic Web
The Semantic Web is an endeavour aiming at enhancing Web data with meta-data and data processing, as well as processing methods specifying the “meaning” of such data and allowi...
François Bry, Bernhard Lorenz, Hans Jü...
LICS
2010
IEEE
14 years 11 months ago
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
Martin Grohe
CL
2012
Springer
13 years 3 months ago
Maintaining distributed logic programs incrementally
Distributed logic programming languages, that allow both facts and programs to be distributed among different nodes in a network, have been recently proposed and used to declarati...
Vivek Nigam, Limin Jia, Boon Thau Loo, Andre Scedr...
LPAR
2010
Springer
14 years 11 months ago
Automated Proof Compression by Invention of New Definitions
State-of-the-art automated theorem provers (ATPs) are today able to solve relatively complicated mathematical problems. But as ATPs become stronger and more used by mathematicians...
Jirí Vyskocil, David Stanovský, Jose...