17,985 Hits in 31.2 sec

Top-down semantics of fair computations of logic programs

M.H.van Emden, M.A. Nait Abdallah
1985 The Journal of Logic Programming  
We discuss the application of our theorem to fair (in the sense of Lassez and Maher) infinite computations. a  ...  A successful SLD-derivation from a logic program has as result a positive assertion which is a logical implication of the program regarded as a theory of first-order logic.  ...  We thank Andre Trudel for his careful reading of the paper and for his suggestions for improvement.  ... 
doi:10.1016/0743-1066(85)90005-6 fatcat:wvzr4jj3ungbbnaz7ze2esqd6q

Page 2398 of Mathematical Reviews Vol. , Issue 96d [page]

1996 Mathematical Reviews  
Dallas, TX); Swift, Terrance (1-SUNYS-C; Stony Brook, NY); Warren, David S. (1-SUNYS-C; Stony Brook, NY) Efficient top-down computation of queries under the well-founded semantics.  ...  .; Levi, Giorgio (I-PISA-IF; Pisa) Observable semantics for constraint logic programs. (English summary) J. Logic Comput. 5 (1995), no. 2, 133-171.  ... 

Top-down Splitting Property for Epistemic Logic Programs

Stefania Costantini
2021 International Conference on Logic Programming  
In this paper we consider Epistemic Logic Programs (ELPs), which extend Answer Set Programming (ASP) with "epistemic operators".  ...  There are several approaches to the semantics of such programs in terms of World Views, which are sets of belief sets.  ...  In [25, 26] it is shown how to compute the unique world view bottom-up. We have just seen how to compute it top-down. So, on this class of programs the two methods coincide.  ... 
dblp:conf/iclp/Costantini21 fatcat:rxoxzegcxbbi7ghmlwnzftdu2a

Page 2955 of Mathematical Reviews Vol. , Issue 95e [page]

1995 Mathematical Reviews  
After introducing the notions of fair transition systems and the spec- ification language of temporal logic, we present proof rules for verifying properties of programs.  ...  This thesis includes the following chapters: Introduction; Hoare’s logic and VDM; Parameterized semantics for fault tolerant real- time systems; exception handling in process algebra; top-down development  ... 

Page 6441 of Mathematical Reviews Vol. , Issue 2004h [page]

2004 Mathematical Reviews  
These notions are then used to define a top-down query processing method for the possible models.  ...  From logic programming we maintain the ease of computing, and from adap- tive logics their paraconsistency, dynamics and non-monotonicity.  ... 

S-semantics for logic programming: A retrospective look

Annalisa Bossi
2009 Theoretical Computer Science  
The semantics is given in terms of extended interpretations, which are more expressive than Herbrand interpretations, extends the standard Herbrand semantics, and can be obtained as a result of both top-down  ...  The paper provides an overview of the s-semantic approach to the semantics of logic programs which had been developed about twenty years ago.  ...  In the field of logic programs we find two main approaches which correspond to the two main possible constructions of the semantics: top-down and bottom-up.  ... 
doi:10.1016/j.tcs.2009.07.039 fatcat:g65x4lanenbqxluozef34rsipq

Page 145 of Journal of Research and Practice in Information Technology Vol. 18, Issue 3 [page]

1986 Journal of Research and Practice in Information Technology  
-L. and MAHER, M.J. (1984): Closures and Fairness in the Semantics of Programming Logic, Theoretical Computer Science, Vol. 29, pp. 167-184.  ...  SAGIV, Y. and ULLMAN, J.D. (1984): Complexity of a Top- Down Capture Rule, Technical Report STAN-CS-84-1009, Dept of Computer Science, Stanford Univ. , July.  ... 

Page 2839 of Mathematical Reviews Vol. , Issue 89E [page]

1989 Mathematical Reviews  
Mathematical foundations of programming language semantics (New Orleans, LA, 1987), 364-371, Lecture Notes in Comput. Sci., 298, Springer, Berlin-New York, 1988.  ...  Each level in the specified hierarchy is a kind of incarnation from higher levels by adding some implementation strategies, and the correctness of top-down refinements can be verified in the unified temporal  ... 

Page 2775 of Mathematical Reviews Vol. , Issue 2002D [page]

2002 Mathematical Reviews  
Although applicable for both logic programs and deductive databases, the proposed top- down computation method requires an assumption that seems to be more suited to the deductive database setting.  ...  Summary: “The efficient learnability of restricted classes of logic programs is studied in the PAC framework of computational learn- ing theory.  ... 

Page 5791 of Mathematical Reviews Vol. , Issue 86m [page]

1986 Mathematical Reviews  
A. (3-MMAS) Top-down semantics of fair computations of logic programs. J. Logic Programming 2 (1985), no. 1, 67-75.  ...  We discuss the application of our theorem to fair (in the sense of Lassez and Maher) infinite computations.” 86m:68084 Kozen, Dexter (1-IBM) A probabilistic PDL. J. Comput.  ... 

The s-semantics approach: Theory and applications

Annalisa Bossi, Maurizio Gabbrielli, Giorgio Levi, Maurizio Martelli
1994 The Journal of Logic Programming  
The semantics in terms of extended interpretations can be obtained as a result of both an operational (top-down) and a fixpoint (bottom-up) construction.  ...  This paper is a general overview of an approach to the semantics of logic programs whose aim is to find notions of models which really capture the operational semantics, and are, therefore, useful for  ...  The semantics in [ll] has only a top-down definition.  ... 
doi:10.1016/0743-1066(94)90026-4 fatcat:5d5ypkaogvafhk2lxz43h3c4mq

Goal dependent vs. goal independent analysis of logic programs [chapter]

M. Codish, M. García Banda, M. Bruynooghe, M. Hermenegildo
1994 Lecture Notes in Computer Science  
We illustrate the efficient use of existing goal dependent, top-down frameworks for abstract interpretation in performing goal independent analyses of logic programs much the same as those usually derived  ...  Goal independent analysis of logic programs is commonly discussed in the context of the bottom-up approach.  ...  Maria Jos6 Garcia de la Banda is supported in part by a Spanish Ministry of Education Grant.  ... 
doi:10.1007/3-540-58216-9_46 fatcat:eq55jnzt5beqlargleghsuiqoy

Transactions and updates in deductive databases

D. Montesi, E. Bertino, M. Martelli
1997 IEEE Transactions on Knowledge and Data Engineering  
We call this approach non-immediate update semantics. We provide a topdown and equivalent bottom-up semantics which re ect the corresponding computation models.  ...  We also package set of updates into transactions and we provide a formal semantics for transactions.  ...  equivalence of top-down and bottom-up computation models.  ... 
doi:10.1109/69.634755 fatcat:7aczjyznkjg6jarmhozqq7rg64

Learning an Executable Neural Semantic Parser [article]

Jianpeng Cheng and Siva Reddy and Vijay Saraswat and Mirella Lapata
2018 arXiv   pre-print
Experiments across a wide range of datasets demonstrate the effectiveness of our parser.  ...  This paper describes a neural semantic parser that maps natural language utterances onto logical forms which can be executed against a task-specific environment, such as a knowledge base or a database,  ...  Table 3 : 3 Top-down generation of the logical form count(and(daughterOf(Barack Obama), InfluentialTeensByYear(2014)).  ... 
arXiv:1711.05066v2 fatcat:afikadyvarevvjit7adoscsx7u

Tight Semantics for Logic Programs

Luis Moniz Pereira, Alexandre Miguel Pinto, Marc Herbstritt
2010 International Conference on Logic Programming  
Top-down querying with abduction by need is rendered available too by TS.  ...  In addition, abduction by need top-down querying is not an option with SM,  ...  Relevancy condones top-down querying and avoids the need to compute whole models. It also permits abduction by need, avoiding much useless consideration of irrelevant abducibles.  ... 
doi:10.4230/lipics.iclp.2010.134 dblp:conf/iclp/PereiraP10 fatcat:hjtar74hyvgkrkb7gy7f5oq5qq
« Previous Showing results 1 — 15 out of 17,985 results