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 ...
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...
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 ...
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...
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...