Sciweavers

38 search results - page 2 / 8
» Mathematical Foundations of Answer Set Programming
Sort
View
POPL
1997
ACM
13 years 10 months ago
Proof-Carrying Code
Proof-carrying code is a framework for the mechanical verification of safety properties of machine language programs, but the problem arises of quis custodiat ipsos custodes—wh...
George C. Necula
CSL
2007
Springer
14 years 16 days ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
Arnold Beckmann
BIRTHDAY
2010
Springer
13 years 7 months ago
Thirteen Definitions of a Stable Model
Stable models of logic programs have been studied by many researchers, mainly because of their role in the foundations of answer set programming. This is a review of some of the de...
Vladimir Lifschitz
IJCAI
1989
13 years 7 months ago
Logic Programming with General Clauses and Defaults Based on Model Elimination
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
Marco A. Casanova, Ramiro A. de T. Guerreiro, Andr...

Book
314views
15 years 4 months ago
Programming in Martin-Löf's Type Theory
"This book describes different type theories (theories of types, polymorphic and monomorphic sets, and subsets) from a computing science perspective. It is intended for resear...
Bengt Nordström, Kent Petersson, Jan M. Smith