Sciweavers

1020 search results - page 126 / 204
» Tight Semantics for Logic Programs
Sort
View
JAR
2008
98views more  JAR 2008»
14 years 12 months ago
A Mechanical Analysis of Program Verification Strategies
We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are: (i) stepw...
Sandip Ray, Warren A. Hunt Jr., John Matthews, J. ...
LOGCOM
2010
128views more  LOGCOM 2010»
14 years 10 months ago
Answer Set Programming with Resources
In this paper, we propose an extension of Answer Set Programming (ASP) to support declarative reasoning on consumption and production of resources. We call the proposed extension ...
Stefania Costantini, Andrea Formisano
WCRE
2006
IEEE
15 years 5 months ago
How Programs Represent Reality (and how they don't)
Programming is modeling the reality. Most of the times, the mapping between source code and the real world concepts is captured implicitly in the names of identifiers. Making the...
Daniel Ratiu, Florian Deissenboeck
ENC
2005
IEEE
15 years 5 months ago
Inferring acceptable arguments with Answer Set Programming
Following the argumentation framework and semantics proposed by Dung, we are interested in the problem of deciding which set of acceptable arguments support the decision making in...
Mauricio Osorio, Claudia Zepeda, Juan Carlos Nieve...
ICLP
2010
Springer
15 years 3 months ago
Towards a General Argumentation System based on Answer-Set Programming
Within the last years, especially since the work proposed by Dung in 1995, argumentation has emerged as a central issue in Artificial Intelligence. With the so called argumentatio...
Sarah Alice Gaggl