Sciweavers

2585 search results - page 297 / 517
» Automating Coherent Logic
Sort
View
ICLP
2011
Springer
14 years 10 months ago
Constraints in Non-Boolean Contexts
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...
CADE
2007
Springer
16 years 7 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
SARA
2007
Springer
16 years 22 days ago
Reformulation for Extensional Reasoning
Relational databases have had great industrial success in computer science. The power of the paradigm is made clear both by its widespread adoption and by theoretical analysis. Tod...
Timothy L. Hinrichs, Michael R. Genesereth
ICAIL
2005
ACM
16 years 5 days ago
Computational Law
Computational law is an approach to automated legal reasoning focusing on semantically rich laws, regulations, contract terms, and business rules in the context of electronicallym...
Nathaniel Love, Michael R. Genesereth
LPNMR
2001
Springer
15 years 11 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä