Results 291 to 300 of about 6,681,112 (349)
Some of the next articles are maybe not open access.
Fundamenta Informaticae, 1992
Starting from a general dynamic analysis of reasoning and programming, we develop two main dynamic perspectives upon logic programming. First, the standard fixed point semantics for Horn clause programs naturally supports imperative programming styles.
openaire +2 more sources
Starting from a general dynamic analysis of reasoning and programming, we develop two main dynamic perspectives upon logic programming. First, the standard fixed point semantics for Horn clause programs naturally supports imperative programming styles.
openaire +2 more sources
Journal of Logic and Computation, 1993
Summary: Structuring logic programs to deal with evolving and incomplete knowledge is one of the main issues in representing knowledge with logic. On the one hand, evolving knowledge in logic programming can be modelled through suitable operators for the dynamic composition of separate programs. On the other hand, when dealing with dynamic compositions
BROGI, ANTONIO, E. Lamma, P. Mello
openaire +3 more sources
Summary: Structuring logic programs to deal with evolving and incomplete knowledge is one of the main issues in representing knowledge with logic. On the one hand, evolving knowledge in logic programming can be modelled through suitable operators for the dynamic composition of separate programs. On the other hand, when dealing with dynamic compositions
BROGI, ANTONIO, E. Lamma, P. Mello
openaire +3 more sources
Autoepistemic logic programming
Journal of Automated Reasoning, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
Logic programs as types for logic programs
[1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, 2002Optimistic type systems for logic programs are considered. In such systems types are conservative approximations to the success set of the program predicates. The use of logic programs to describe types is proposed. It is argued that this approach unifies the denotational and operational approaches to descriptive type systems and is simpler and more ...
T. Fruhwirth +3 more
openaire +1 more source
The well-founded semantics for general logic programs
JACM, 1991A. V. Gelder, K. A. Ross, J. Schlipf
semanticscholar +1 more source
Classical negation in logic programs and disjunctive databases
New generation computing, 1991M. Gelfond, V. Lifschitz
semanticscholar +1 more source
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence, 1999I. Niemelä
semanticscholar +1 more source
The temporal logic of programs
18th Annual Symposium on Foundations of Computer Science (sfcs 1977), 1977A. Pnueli
semanticscholar +1 more source
The Temporal Logic of Reactive and Concurrent Systems
Springer: New York, 1991Z. Manna, A. Pnueli
semanticscholar +1 more source

