Results 321 to 330 of about 575,998 (339)

Logic Programming

2020
International ...
Lallouet, Arnaud, Moinard, Yves, Nicolas, Pascal, Stephan, Igor   +3 more
openaire   +2 more sources

Logic programs as types for logic programs

[1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, 2002
Optimistic 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 ...
Thom Frühwirth, Eyal Yardeni, Ehud Shapiro, Moshe Y. Vardi   +3 more
openaire   +2 more sources

Extending logic programming

ACM SIGMOD Record, 1990
An extension of logic programming, called “ordered logic programming”, which includes some abstractions of the object-oriented paradigm, is presented. An ordered program consists of a number of modules (objects), where each module is composed by a number of rules possibly with negated head predicates.
Laenens E., SACCA', Domenico, Vermeir D.
openaire   +5 more sources

Autoepistemic logic programming

Journal of Automated Reasoning, 1993
An autoepistemic logic programming language is derived from a subset of a three-valued autoepistemic logic, called 3AEL. Autoepistemic programs generalize several ideas underlying logic programming: stable, supported, and well-founded models, Fitting's semantics, Kunen's semantics, and abductive frameworks can all be captured through simple ...
openaire   +4 more sources

Logic Programming and Default Logic

International Journal on Artificial Intelligence Tools, 1994
We present several ideas of increasing complexity how to translate default theories to normal logic programs that make direct use of the deductive capacity of logic programming. We show the limitations of simple, ad hoc approaches, and arrive at a more general construction; its main property is that the answer substitutions computed by the logic ...
openaire   +2 more sources

Constraint Logic Programming [PDF]

, 2002
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently used in many commercial applications. Since the original proposal, it has developed enormously: many languages and systems are now available either as open source programs or as
GAVANELLI, Marco, Francesca Rossi
openaire   +3 more sources

Conceptual logic programs [PDF]

Annals of Mathematics and Artificial Intelligence, 2006
Open answer set programming (OASP) solves the lack of modularity in closed world answer set programming by allowing for the grounding of logic programs with an arbitrary non-empty countable superset of the program's constants. However, OASP is, in general, undecidable: the undecidable domino problem can be reduced to it. In order to regain decidability,
Vermeir, Dirk, Heymans, Stijn, Van Nieuwenborgh, Davy   +2 more
openaire   +2 more sources

Meta-Programming in Logic Programming

1998
A meta-program, regardless of the nature of the programming language, is a program whose data denotes another (object) program. The importance of meta-programming can be gauged from its large number of applications. These include compilers, interpreters, program analysers, and program transformers.
Hill, P M, Gallagher, J
openaire   +1 more source

Logics of Programs

1990
Publisher Summary This chapter presents an introduction to some of the basic issues in the study of program logics. The chapter describes various forms of first-order Dynamic Logic and discusses their syntax, semantics, proof theory, and expressiveness.
Dexter Zozen, Jerzy Tiuryn
openaire   +2 more sources