Filters








3,360 Hits in 3.4 sec

Temporal stratification tests for linear and branching-time deductive databases

Christos Nomikos, Panos Rondogiannis, Manolis Gergatsoulis
2005 Theoretical Computer Science  
it does not cover the whole class of temporally stratified programs.  ...  restricts attention to programs that only use one predicate symbol and two constants).  ...  . • Linear time temporal logic programming is only an instance of the much more general paradigm of intensional logic programming [23] .  ... 
doi:10.1016/j.tcs.2005.05.014 fatcat:c4ggsqvoqrdxbe3hk2uogjr4ge

General logical databases and programs: Default logic semantics and stratification

Nicole Bidoit, Christine Froidevaux
1991 Information and Computation  
After presenting, in general, how to use default logic in order to define the meaning of logical databases and logic programs, the class of stratitiable databases and programs is extensively studied in  ...  Default logic is introduced as a well-suited formalism for defining the declarative semantics of deductive databases and logic programs.  ...  Intuitively, the definition of the priority relation associated with ,Z is based on the three following principles : GENERAL LOGICAL DATABASES AND PROGRAMS 39 (a) consequents of a P-clause should have  ... 
doi:10.1016/0890-5401(91)90073-b fatcat:xmez4y73nnbmpk3hzv7izerzpm

Towards a Logic-Based Unifying Framework for Computing [article]

Robert Kowalski, Fariba Sadri
2014 arXiv   pre-print
We also extend the model with intentional predicates and composite event predicates defined by logic programs containing conditions in first-order logic, which query the current state.  ...  In this paper we propose a logic-based, framework inspired by artificial intelligence, but scaled down for practical database and programming applications.  ...  Many thanks also to David Kinny and Ken Satoh for helpful discussions, and to Ken Satoh and Luis Pereira for their comments on an earlier draft of this paper.  ... 
arXiv:1301.6905v2 fatcat:ff3obn7povf2bn5zkvy4wxzqvm

Why untyped nonground metaprogramming is not (much of) a problem

Bern Martens, Danny de Schreye
1995 The Journal of Logic Programming  
We show that this result generalizes to nonlanguage independent programs in the context of an extended Hcrbrand semantics, designed to closely mirror the operational behavior of logic programs.  ...  and solve(p(tl, , tT)) atoms in the weakly perfect Her\) and model of the associated vanilla metaprogram.  ...  Suppose that P is a logic program and let PO = Ground(P), Thus we see that weak stratification is a conservative extension of (local) stratification.  ... 
doi:10.1016/0743-1066(94)00015-x fatcat:swutg37jc5dr5hngoqhv2zvtu4

A three-valued semantics for deductive databases and logic programs

Jia-Huai You, Li Yan Yuan
1994 Journal of computer and system sciences (Print)  
logic programs).  ...  This paper proposes two principles, justifiability and minimal undefinedness, for a threevalued model-theoretic approach to semantics of logic programs and deductive databases (also called disjunctive  ...  The following definition describes a reduction procedure for generally non-ground logic programs. DEFINITION 6.2. Let//be a (ground or nonground) logic program.  ... 
doi:10.1016/s0022-0000(05)80053-4 fatcat:bcm3dpz73naqrd3324wznayro4

Bottom-up computation of perfect models for disjunctive theories

JoséAlberto Fernández, Jack Minker
1995 The Journal of Logic Programming  
D We present a new fixpoint characterization of the minimal models of disjunctive logic programs.  ...  We prove that by applying the operator iteratively, it characterizes the perfect models semantics of stratified disjunctive logic programs.  ...  P be a stratified disjunctive logic program, and let P1,..., Pr be a stratification of the clauses of P.  ... 
doi:10.1016/0743-1066(94)00106-g fatcat:74ndnhen3vbzfeuhfkgqjvqs4i

A stable model semantics for behavioral inheritance in deductive object oriented languages [chapter]

Michele Bugliesi, Hasan M. Jamil
1995 Lecture Notes in Computer Science  
This semantics is reminiscent of the stable model semantics of logic programs with negation.  ...  This condition, in its turn, is inspired by the local stratification condition of perfect model semantics for programs with negation.  ...  This condition is reminiscent of the stratification condition of [15] for logic programs with negation, but in our case it constrains the combination of deduction and inheritance with overriding.  ... 
doi:10.1007/3-540-58907-4_18 fatcat:27ptseugnbacbca6uguxqzgbzi

An Operational Semantics of Starlog [chapter]

Lunjin Lu, John G. Cleary
1999 Lecture Notes in Computer Science  
Starlog is a temporal logic programming language that supports declarative specification of reactive systems, input-output behaviour and destructive updates.  ...  Its correctness and completeness with respect to a model semantics are proved.  ...  GL(G, M) is a definite logic program obtained by removing those clauses in G whose bodies contain the negation of an atom in M and deleting negative literals in other clauses in G.  ... 
doi:10.1007/10704567_18 fatcat:h2btrwzz4nhkfi2po3am3k2bg4

Page 6171 of Mathematical Reviews Vol. , Issue 94k [page]

1994 Mathematical Reviews  
(Only the so-called definite programs are treated, and thus logic programs with negation are not considered.)  ...  Summary: “We generalize Horn clause logic by using arbitrary al- gebras instead of the free algebras of terms. ‘Local’ in the title means that deductions are performed in a fixed algebra.  ... 

The expressiveness of locally stratified programs

Howard A. Blair, V. Wiktor Marek, John S. Schlipf
1995 Annals of Mathematics and Artificial Intelligence  
This paper completes an investigation of the logical expressibility of finite, locally stratified, general logic programs.  ...  As a consequence, we show that the minimum lengths of (local) stratification of logic programs are arbitrary large constructive ordinals.  ...  Definition 4.1 A binary logic program is a definite clause program with at most one atom in any clause body.  ... 
doi:10.1007/bf01534455 fatcat:m5a3o2cygnfchcypieeo4fdghm

Strpro Tool For Manipulation Of Stratified Programs Based On Sepn

Chadlia Jerad, Amel Grissa-Touzi, Habib Ounelli
2007 Zenodo  
SEPN nets are well adapted extension of predicate nets for the definition and manipulation of stratified programs. This formalism is characterized by two main contributions.  ...  The first concerns the management of the whole class of stratified programs. The second contribution is related to usual operations optimization (maximal stratification, incremental updates ...).  ...  A predicate symbol q definition is the set of all the clauses of the program P having q at the head of the clause.  ... 
doi:10.5281/zenodo.1332829 fatcat:xafe3dkaujcxvkc5rno7uqht2u

The relationship between stable, supported, default and autoepistemic semantics for general logic programs

W. Marek, V.S. Subrahmanian
1992 Theoretical Computer Science  
First author's work was partly supported by National Science Foundation Grant RI1 8610671 and the Commonwealth of Kentucky EPSCoR program.  ...  We thank Howard Blair for comments which helped simplify and improve many of the proofs as well as the presentation.  ...  A is called the head of the above clause, and L, 8~. . . & L, is called the body of the above clause. Definition 2 . 2 A general logic program is a finite set of clauses.  ... 
doi:10.1016/0304-3975(92)90019-c fatcat:gfesc7l4efgllmsnjkulliliwy

Logic programming and negation: A survey

Krzysztof R. Apt, Roland N. Bol
1994 The Journal of Logic Programming  
Finally, a general program is a finite set of general clauses.  ...  Parts of this research (like stratification and the use of perfect model semantics) overlap with that of logic programming.  ... 
doi:10.1016/0743-1066(94)90024-8 fatcat:krg2a4l2zbdqlftzysdsszfj64

Eliminating negation from normal logic programs [chapter]

Kanchana Kanchanasut, Peter Stuckey
1990 Lecture Notes in Computer Science  
We show that for a class of programs where every negative subgoal can be expanded, the resultant program P is a definite logic program with equality and disequality constraints.  ...  Our proposed scheme provides a sound and complete query answering system for a class of programs whose positive part has a finite T ω P and whose clauses satisfy the positive grounded property defined  ...  Acknowledgement : We would like to thank Phan Minh Dung, James Harland, Kotagiri Ramamohanarao and Harald Sondergaard for useful comments and discussions on earlier drafts.  ... 
doi:10.1007/3-540-53162-9_41 fatcat:ajgj4pigs5bzzf7m2icjsjthae

Extensional Semantics for Higher-Order Logic Programs with Negation [article]

Panos Rondogiannis, Ioanna Symeonidou
2017 arXiv   pre-print
As an immediate useful consequence of our developments, we define for the language we consider the notions of stratification and local stratification, which generalize the familiar such notions from classical  ...  ] to higher-order logic programs, does not in general lead to extensional stable models.  ...  In Section 7 the notions of stratification and local stratification for higher-order logic programs are introduced.  ... 
arXiv:1701.08622v2 fatcat:7q3uzvlkpvf7bdas25m7g7mkhi
« Previous Showing results 1 — 15 out of 3,360 results