Results 321 to 330 of about 567,077 (336)
Some of the next articles are maybe not open access.
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
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, 1993An 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
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
Logic Programming and Default Logic
International Journal on Artificial Intelligence Tools, 1994We 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
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 +2 more
openaire +2 more sources
Meta-Programming in Logic Programming
1998A 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
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
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
2011
Due to the problems with first-order logic mentioned in Chap. 4, pure logic can not solve most realistic AI problems. Logic programming as a fusion of logic and procedural programming provides the programmer with means for controlling and optimizing logical reasoning.
openaire +2 more sources
Due to the problems with first-order logic mentioned in Chap. 4, pure logic can not solve most realistic AI problems. Logic programming as a fusion of logic and procedural programming provides the programmer with means for controlling and optimizing logical reasoning.
openaire +2 more sources
Studia Logica, 1985
We use the algebraic theory of programs as in Blikle [2], Mazurkiewicz [5] in order to show that the difference between programs with and without recursion is of the same kind as that between cut free Gentzen type formalizations of predicate and prepositional logics.
openaire +2 more sources
We use the algebraic theory of programs as in Blikle [2], Mazurkiewicz [5] in order to show that the difference between programs with and without recursion is of the same kind as that between cut free Gentzen type formalizations of predicate and prepositional logics.
openaire +2 more sources
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