Sciweavers

180 search results - page 10 / 36
» Declarative Semantics of Input Consuming Logic Programs
Sort
View
CORR
2010
Springer
96views Education» more  CORR 2010»
13 years 5 months ago
A Simple Correctness Proof for Magic Transformation
The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The ...
Wlodzimierz Drabent
LPNMR
2007
Springer
14 years 1 months ago
Modularity Aspects of Disjunctive Stable Models
Practically all programming languages used in software engineering allow to split a program into several modules. For fully declarative and nonmonotonic logic programming languages...
Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Ste...
SAT
2005
Springer
142views Hardware» more  SAT 2005»
14 years 1 months ago
Optimizations for Compiling Declarative Models into Boolean Formulas
Advances in SAT solver technology have enabled many automated analysis and reasoning tools to reduce their input problem to a SAT problem, and then to use an efficient SAT solver ...
Darko Marinov, Sarfraz Khurshid, Suhabe Bugrara, L...
SWAP
2008
13 years 9 months ago
Ontological Reasoning and Abductive Logic Programming for Service Discovery and Contracting
Abstract. The Service Oriented Architecture paradigm, and its implementation based on Web Services, have been the object of an intense research and standardization activity. One of...
Federico Chesani, Paola Mello, Marco Montali, Paol...
IWFM
2000
112views Formal Methods» more  IWFM 2000»
13 years 9 months ago
A Note on the Relationships Between Logic Programs and Neural Networks
Several recent publications have exhibited relationships between the theories of logic programming and of neural networks. We consider a general approach to representing normal lo...
Pascal Hitzler, Anthony Karel Seda