Sciweavers

393 search results - page 29 / 79
» Logic Programs with Classical Negation
Sort
View
LPNMR
2009
Springer
15 years 4 months ago
Complexity of the Stable Model Semantics for Queries on Incomplete Databases
Abstract. We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with n...
Jos de Bruijn, Stijn Heymans
AGP
2003
IEEE
15 years 3 months ago
An Evolving Agent with EVOLP
Abstract. Logic programming has often been considered less than adequate for modelling the dynamics of knowledge changing over time. Evolving Logic Programs (EVOLP) has been recent...
José Júlio Alferes, Antonio Brogi, J...
KI
2007
Springer
15 years 3 months ago
Proposal of Generalized Rule Programming Model
Abstract. Rule-based programming paradigm is omnipresent in number of engineering domains. However, there are some fundamental semantical differences between it, and classic progr...
Grzegorz J. Nalepa, Igor Wojnicki
POPL
2002
ACM
15 years 10 months ago
Proving correctness of compiler optimizations by temporal logic
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
David Lacey, Neil D. Jones, Eric Van Wyk, Carl Chr...
ICDT
1997
ACM
97views Database» more  ICDT 1997»
15 years 1 months ago
Queries and Computation on the Web
The paper introduces a model of the Web as an in nite, semistructured set of objects. We reconsider the classical notions of genericity and computability of queries in this new con...
Serge Abiteboul, Victor Vianu