Entry Drabent:1988:IAM from tcs1985.bib
Last update: Thu Sep 27 02:46:57 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Drabent:1988:IAM,
author = "Wlodzimierz Drabent and Jan Maluszynski",
title = "Inductive assertion method for logic programs",
journal = j-THEOR-COMP-SCI,
volume = "59",
number = "1--2",
pages = "133--155",
month = jul,
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Polish Acad of Sciences",
affiliationaddress = "Warsaw, Pol",
classification = "723; C4240 (Programming and algorithm theory)",
conference = "International Joint Conference on Theory and Practice
of Software Development --- TAPSOFT '87",
conflocation = "Pisa, Italy; 23-27 March 1987",
conftitle = "International Joint Conference on Theory and Practice
of Software Development",
corpsource = "Inst. of Comput. Sci., Polish Acad. of Sci., Warszawa,
Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "arbitrary search strategy; Computer
Metatheory--Programming Theory; Computer Programming;
Declarative Semantics; declarative semantics;
extra-logical built-in procedures; Inductive Assertion;
inductive assertion method; informal reasoning; logic
programming; Logic Programs; logic programs;
OR-parallelism; Partial Correctness; partial
correctness; procedure calls; programming theory;
Prolog backtracking; Prolog Computation Rule; Prolog
computation rule; theorem proving; Theory",
meetingaddress = "Pisa, Italy",
meetingdate = "Mar 23--27 1987",
meetingdate2 = "03/23--27/87",
pubcountry = "Netherlands",
sponsor = "Univ di Pisa, Pisa, Italy; IEI-CNR; CNUCE-CNR; EATS;
AICA",
treatment = "T Theoretical or Mathematical",
}
Related entries
- arbitrary,
36(1)1,
37(3)269,
38(1)55,
42(1)1,
45(1)87,
45(2)193,
49(2)239,
52(3)177,
55(1)87,
57(2)283,
59(3)211,
61(1)83,
62(3)289,
64(1)15,
67(2)203
- assertion,
36(1)127,
39(2)189,
50(3)285
- backtracking,
54(1)3,
68(1)57
- computation,
35(2)191,
36(1)1,
36(1)127,
39(2)107,
40(2)211,
40(2)275,
40(2)323,
41(2)325,
43(2)149,
44(1)1,
46(2)159,
46(2)319,
47(1)39,
47(2)111,
47(2)131,
47(2)205,
47(3)315,
48(2)257,
49(2)171,
52(3)193,
52(3)251,
53(1)125,
53(2)201,
53(2)267,
54(1)65,
57(2)327,
58(1)347,
59(1)25,
59(3)277,
59(3)297,
60(3)231,
60(3)297,
62(1)187,
62(3)311,
64(1)55,
64(3)221,
67(1)99,
68(1)19,
68(3)267,
68(3)277
- correctness,
36(1)127,
37(2)183,
38(2)269,
39(1)47,
39(2)189,
40(2)257,
43(2)123,
50(3)285,
56(1)59,
56(3)345,
61(2)225,
62(1)123,
63(1)91,
67(2)173,
69(2)117
- declarative,
42(2)123,
46(2)141,
65(3)343,
69(3)289
- inductive,
43(1)81,
46(2)175,
54(1)3,
55(1)87,
62(3)289
- Metatheory--Programming,
58(1)263,
59(1)3,
59(1)157,
61(2)225,
61(2)259,
67(1)129
- method,
35(2)345,
36(2)145,
39(2)107,
41(1)19,
41(1)33,
44(1)1,
44(2)127,
45(2)193,
46(2)285,
47(3)277,
50(3)285,
52(3)193,
52(3)307,
53(2)345,
54(1)65,
54(1)129,
56(3)277,
58(1)183,
62(1)187,
63(3)253,
63(3)275,
63(3)303,
65(1)1,
65(2)213,
65(3)291,
67(1)55,
69(1)55
- partial,
36(1)127,
37(3)269,
39(1)47,
39(2)189,
40(1)31,
40(2)323,
43(2)149,
45(1)1,
48(2)229,
53(1)3,
55(1)87,
57(1)3,
60(1)1,
60(3)341,
61(2)199,
62(3)251,
63(1)43,
63(2)113,
63(2)141,
64(1)67,
64(3)281,
65(2)221,
66(3)289,
67(1)19,
67(1)129,
67(2)283,
68(1)37,
68(3)343,
69(2)117
- procedure,
35(2)129,
36(2)251,
41(1)113,
42(3)251,
44(2)127,
44(2)237,
47(1)61,
48(2)229,
49(2)217,
53(1)25,
53(1)z,
57(1)131,
58(1)155,
59(1)115,
60(1)83,
66(2)117,
67(2)173,
69(1)1
- Programming, Metatheory-,
58(1)263,
59(1)3,
59(1)157,
61(2)225,
61(2)259,
67(1)129
- proving,
35(2)129,
35(2)215,
37(2)151,
37(2)183,
43(2)123,
43(2)277,
44(2)127,
53(1)125,
54(1)3,
54(1)29,
54(2)249,
56(1)135,
56(3)277,
59(3)287,
67(2)173,
67(2)203,
69(3)243
- reasoning,
40(2)315,
43(1)81,
65(1)35,
69(3)243
- rule,
35(2)129,
37(3)245,
38(1)99,
41(2)271,
43(2)123,
45(1)1,
46(1)13,
49(2)311,
51(1)27,
51(1)129,
53(1)125,
57(1)3,
62(1)3,
63(3)253,
65(3)291,
67(2)283,
67(2)303
- search,
39(2)89,
41(2)325,
47(1)61,
47(2)205,
47(3)277,
58(1)57,
58(1)143,
58(1)209,
59(3)297,
63(2)185,
66(0)117,
66(1)105,
66(2)181,
68(3)343,
69(1)1
- strategy,
53(1)151,
65(1)1,
65(3)271,
67(1)5
- theorem,
35(2)129,
37(1)51,
37(1)77,
37(2)183,
38(1)123,
38(1)137,
38(2)143,
39(2)135,
39(2)155,
43(1)91,
43(1)99,
43(2)315,
44(2)127,
44(3)333,
46(2)305,
47(1)1,
48(1)1,
48(2)183,
48(2)201,
49(1)1,
49(2)283,
51(1)117,
52(1)1,
52(1)145,
52(3)205,
52(3)239,
53(1)125,
53(2)169,
54(1)3,
54(1)29,
54(2)249,
56(3)277,
57(2)161,
57(2)239,
59(3)287,
61(1)17,
61(2)279,
64(1)1,
64(1)15,
64(3)331,
65(2)149,
65(3)271,
67(2)173,
67(2)203,
68(1)89,
68(3)277,
69(3)243