Sciweavers

580 search results - page 43 / 116
» On the Foundations of Answer Set Programming
Sort
View
JAIR
2008
104views more  JAIR 2008»
13 years 8 months ago
Sound and Complete Inference Rules for SE-Consequence
The notion of strong equivalence on logic programs with answer set semantics gives rise to a consequence relation on logic program rules, called SE-consequence. We present a sound...
Ka-Shu Wong
AI
2011
Springer
13 years 3 months ago
Stable models and circumscription
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programmi...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
POPL
1997
ACM
14 years 28 days 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
ICLP
2009
Springer
14 years 9 months ago
Using Histograms to Better Answer Queries to Probabilistic Logic Programs
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
Matthias Broecheler, Gerardo I. Simari, V. S. Subr...
IFIP
2000
Springer
14 years 9 days ago
Information Systems Conceptual Foundations: Looking Backward and Forward
The academic field of information systems has developed because organizations use a specialized body of knowledge about information and communications systems. Teaching and resear...
Gordon B. Davis