Sciweavers

3845 search results - page 553 / 769
» Belief Logic Programming
Sort
View
IGPL
2008
124views more  IGPL 2008»
15 years 6 months ago
The Ricean Objection: An Analogue of Rice's Theorem for First-order Theories
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
Igor Carboni Oliveira, Walter Alexandre Carnielli
CADE
2007
Springer
16 years 6 months ago
A Sequent Calculus for Integer Arithmetic with Counterexample Generation
We introduce a calculus for handling integer arithmetic in first-order logic. The method is tailored to Java program verification and meant to be used both as a supporting procedur...
Philipp Rümmer
SIGMOD
2006
ACM
122views Database» more  SIGMOD 2006»
16 years 6 months ago
The ADO.NET entity framework: making the conceptual level real
This paper describes the ADO.NET Entity Framework, a platform for programming against data that raises the level of ion from the logical (relational) level to the conceptual (enti...
Anil Nori, José A. Blakeley, S. Muralidhar
TACAS
2010
Springer
178views Algorithms» more  TACAS 2010»
16 years 1 months ago
An Alternative to SAT-Based Approaches for Bit-Vectors
The theory BV of bit-vectors, i.e. fixed-size arrays of bits equipped with standard low-level machine instructions, is becoming very popular in formal verification. Standard solv...
Sébastien Bardin, Philippe Herrmann, Floria...
FOSSACS
2007
Springer
16 years 23 days ago
PDL with Intersection and Converse Is 2 EXP-Complete
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
Stefan Göller, Markus Lohrey, Carsten Lutz