-
1
-
-
0002198395
-
Towards a theory of declarative knowledge
-
J. Minker (Ed.), Morgan Kaufmann, Los Altos, CA
-
K.R. Apt, H.A. Blair, A. Walker, Towards a theory of declarative knowledge, in: J. Minker (Ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, CA, 1988, pp. 89-148.
-
(1988)
Foundations of Deductive Databases and Logic Programming
, pp. 89-148
-
-
Apt, K.R.1
Blair, H.A.2
Walker, A.3
-
2
-
-
0001609012
-
Reasoning about termination of pure prolog programs
-
Apt K.R., Pedreschi D. Reasoning about Termination of Pure Prolog Programs. Inform. Comput. 106:1993;109-157.
-
(1993)
Inform. Comput.
, vol.106
, pp. 109-157
-
-
Apt, K.R.1
Pedreschi, D.2
-
4
-
-
0024738668
-
Topological model set deformations in logic programming
-
Batarekh A., Subrahmanian V.S. Topological model set deformations in logic programming. Fundamenta Informaticae. 12(3):1989;357-400.
-
(1989)
Fundamenta Informaticae
, vol.12
, Issue.3
, pp. 357-400
-
-
Batarekh, A.1
Subrahmanian, V.S.2
-
5
-
-
0042895938
-
The query topology in logic programming
-
Proc. 1989 Symp. Theoretical Aspects of Computer Science, Springer, Berlin
-
A. Batarekh, V.S. Subrahmanian, The query topology in logic programming, in: Proc. 1989 Symp. Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 349, Springer, Berlin, 1989, pp. 375-387.
-
(1989)
Lecture Notes in Computer Science
, vol.349
, pp. 375-387
-
-
Batarekh, A.1
Subrahmanian, V.S.2
-
6
-
-
0040123795
-
Characterizing termination of logic programs with level mappings
-
E.L. Lusk, & R.A. Overbeek (Eds.), Cambridge, MA: MIT Press
-
Bezem M. Characterizing termination of logic programs with level mappings. Lusk E.L., Overbeek R.A. Proc. North American Conf. Logic Programming. 1989;69-80 MIT Press, Cambridge, MA.
-
(1989)
Proc. North American Conf. Logic Programming
, pp. 69-80
-
-
Bezem, M.1
-
7
-
-
0042394999
-
Continuous models of computation for Logic Programs
-
K.R. Apt, V.W. Marek, M. Truszcynski, & D.S. Warren (Eds.), Berlin: Springer
-
Blair H.A., Dushin F., Jakel D.W., Rivera A.J., Sezgin M. Continuous models of computation for Logic Programs. Apt K.R., Marek V.W., Truszcynski M., Warren D.S. The Logic Programming Paradigm: a 25-Year Perspective. 1999;231-255 Springer, Berlin.
-
(1999)
The Logic Programming Paradigm: A 25-Year Perspective
, pp. 231-255
-
-
Blair, H.A.1
Dushin, F.2
Jakel, D.W.3
Rivera, A.J.4
Sezgin, M.5
-
8
-
-
0041392862
-
Hybrid automata: Convergence spaces and continuity
-
Orlando, Florida, USA, July, 2001, International Institute of Informatics and Systemics
-
H.A. Blair and J. Remmel, Hybrid automata: convergence spaces and continuity, Proc. joint IIIS & IEEE meeting of the 5th World Multiconference on Systemics, Cybernetics and Informatics (SCI2001) and the 7th International Conference on Information Systems Analysis and Synthesis (ISAS2001), Orlando, Florida, USA, July, 2001, International Institute of Informatics and Systemics, 2001.
-
(2001)
Proc. Joint IIIS & IEEE Meeting of the 5th World Multiconference on Systemics, Cybernetics and Informatics (SCI2001) and the 7th International Conference on Information Systems Analysis and Synthesis (ISAS2001)
-
-
Blair, H.A.1
Remmel, J.2
-
10
-
-
0026204235
-
Acyclic programs and the completeness of SLDNF-resolution
-
Cavedon L. Acyclic programs and the completeness of SLDNF-resolution. Theoret. Comput. Sci. 86:1991;81-92.
-
(1991)
Theoret. Comput. Sci.
, vol.86
, pp. 81-92
-
-
Cavedon, L.1
-
11
-
-
0000826543
-
Negation as failure
-
H. Gallaire, & J. Minker. New York: Plenum Press
-
Clark K.L. Negation as failure. Gallaire H., Minker J. Logic and Data Bases. 1978;293-322 Plenum Press, New York.
-
(1978)
Logic and Data Bases
, pp. 293-322
-
-
Clark, K.L.1
-
12
-
-
0002574415
-
A computational model for metric spaces
-
Edalat A., Heckmann R. A computational model for metric spaces. Theoret. Comput. Sci. 193:1998;53-73.
-
(1998)
Theoret. Comput. Sci.
, vol.193
, pp. 53-73
-
-
Edalat, A.1
Heckmann, R.2
-
13
-
-
0008583484
-
A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics
-
Fages F. A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics. New Gen. Comput. 9:1991;425-443.
-
(1991)
New Gen. Comput.
, vol.9
, pp. 425-443
-
-
Fages, F.1
-
14
-
-
0010077202
-
Consistency of Clark's completion and existence of stable models
-
Fages F. Consistency of Clark's completion and existence of stable models. J. Methods of Logic in Comput. Sci. 1:1994;51-60.
-
(1994)
J. Methods of Logic in Comput. Sci.
, vol.1
, pp. 51-60
-
-
Fages, F.1
-
15
-
-
0022180593
-
A Kripke-Kleene-semantics for general logic programs
-
Fitting M. A Kripke-Kleene-semantics for general logic programs. J. Logic Programming. 2:1985;295-312.
-
(1985)
J. Logic Programming
, vol.2
, pp. 295-312
-
-
Fitting, M.1
-
16
-
-
0028550693
-
Metric methods: Three examples and a theorem
-
Fitting M. Metric methods. three examples and a theorem J. Logic Programming. 21(3):1994;113-127.
-
(1994)
J. Logic Programming
, vol.21
, Issue.3
, pp. 113-127
-
-
Fitting, M.1
-
17
-
-
71149116148
-
The well-founded semantics for general logic programs
-
Van Gelder A., Ross K.A., Schlipf J.S. The well-founded semantics for general logic programs. J. ACM. 38(3):1991;620-650.
-
(1991)
J. ACM
, vol.38
, Issue.3
, pp. 620-650
-
-
Van Gelder, A.1
Ross, K.A.2
Schlipf, J.S.3
-
18
-
-
0001119421
-
The stable model semantics for logic programming
-
R.A. Kowalski, & K.A. Bowen (Eds.), Cambridge, MA: MIT Press
-
Gelfond G., Lifschitz V. The stable model semantics for logic programming. Kowalski R.A., Bowen K.A. Logic Programming, Proc. 5th Internat. Conf. and Symp. on Logic Programming. 1988;1070-1080 MIT Press, Cambridge, MA.
-
(1988)
Logic Programming, Proc. 5th Internat. Conf. and Symp. on Logic Programming
, pp. 1070-1080
-
-
Gelfond, G.1
Lifschitz, V.2
-
19
-
-
4244128485
-
A topological study of the upward refinement operators in ILP
-
J. Cussens, A. Frisch (Eds.), London
-
M.A. Gutiérrez Naranjo, J.A. Alonso Jiménez, J. Borrego Díaz, A topological study of the upward refinement operators in ILP, in: J. Cussens, A. Frisch (Eds.), Inductive Logic Programming, 10th Internat. Conf. (ILP2000) work-in-Progress Reports, London, 2000, pp. 120-137.
-
(2000)
Inductive Logic Programming, 10th Internat. Conf. (ILP2000) Work-in-Progress Reports
, pp. 120-137
-
-
Gutiérrez Naranjo, M.A.1
Alonso Jiménez, J.A.2
Borrego Díaz, J.3
-
20
-
-
0042895939
-
-
Ph.D. Thesis, Department of Mathematics, National University of Ireland, University College Cork
-
P. Hitzler, Generalized metrics and topology in logic programming semantics, Ph.D. Thesis, Department of Mathematics, National University of Ireland, University College Cork, 2001.
-
(2001)
Generalized Metrics and Topology in Logic Programming Semantics
-
-
Hitzler, P.1
-
21
-
-
84958598538
-
Characterizations of classes of programs by three-valued operators
-
M. Gelfond, N. Leone, & G. Pfeifer (Eds.), Logic Programming and Non-Monotonic Reasoning, Proc. 5th Internat. Conf. on Logic Programming and Non-Monotonic Reasoning (LPNMR'99), El Paso, Texas, USA, December 1999, Berlin: Springer
-
Hitzler P., Seda A.K. Characterizations of classes of programs by three-valued operators. Gelfond M., Leone N., Pfeifer G. Logic Programming and Non-Monotonic Reasoning, Proc. 5th Internat. Conf. on Logic Programming and Non-Monotonic Reasoning (LPNMR'99), El Paso, Texas, USA, December 1999. Lecture Notes in Artificial Intelligence. Vol. 1730:1999;357-371 Springer, Berlin.
-
(1999)
Lecture Notes in Artificial Intelligence
, vol.1730
, pp. 357-371
-
-
Hitzler, P.1
Seda, A.K.2
-
22
-
-
34250800935
-
The fixed-point theorems of Priess-Crampe and Ribenboim in logic programming
-
F.V. Kuhlmann, S. Kuhlmann, M. Marshall (Eds.), Saskatchewan, Canada, July 1999, Fields Institute Communications Series, American Mathematical Society, Providence, RJ
-
P. Hitzler, A.K. Seda, The fixed-point theorems of Priess-Crampe and Ribenboim in logic programming, in: F.V. Kuhlmann, S. Kuhlmann, M. Marshall (Eds.), Proc. Internat. Conf. Workshop in Valuation Theory in Honour of Paulo Ribenboim, Saskatchewan, Canada, July 1999, Fields Institute Communications Series, Vol. 32, American Mathematical Society, Providence, RJ, 2002, pp. 219-235.
-
(2002)
Proc. Internat. Conf. Workshop in Valuation Theory in Honour of Paulo Ribenboim
, vol.32
, pp. 219-235
-
-
Hitzler, P.1
Seda, A.K.2
-
23
-
-
0041392847
-
Acceptable programs revisited
-
Proc. Workshop on Verification in Logic Programming, 16th Internat. Conf. on Logic Programming (ICLP'99), Las Cruces, New Mexico, November, 1999, Elsevier, Amsterdam
-
P. Hitzler, A.K. Seda, Acceptable programs revisited, Proc. Workshop on Verification in Logic Programming, 16th Internat. Conf. on Logic Programming (ICLP'99), Las Cruces, New Mexico, November, 1999, Electronic Notes in Theoretical Computer Science, Vol. 30, 1, Elsevier, Amsterdam, 1999, pp. 1-18.
-
(1999)
Electronic Notes in Theoretical Computer Science
, vol.30
, Issue.1
, pp. 1-18
-
-
Hitzler, P.1
Seda, A.K.2
-
24
-
-
0042895977
-
Dislocated topologies
-
Proc. Slovakian Conf. in Applied Mathematics, Bratislava, 2000, Slovak Academy of Sciences
-
P. Hitzler, A.K. Seda, Dislocated topologies, Proc. Slovakian Conf. in Applied Mathematics, Bratislava, 2000, J. Electr. Engng, Vol. 51 No. 12/s, Slovak Academy of Sciences, 2000, pp. 3-7.
-
(2000)
J. Electr. Engng
, vol.51
, Issue.12 S
, pp. 3-7
-
-
Hitzler, P.1
Seda, A.K.2
-
25
-
-
0042394970
-
A new fixed-point theorem for logic programming semantics
-
Orlando, Florida, USA, July 2000, International Institute of Informatics and Systemics: IIIS, Computer Science and Engineering Part 1
-
P. Hitzler, A.K. Seda, A new fixed-point theorem for logic programming semantics, Proc. joint IIIS & IEEE meeting of the 4th World Multiconference on Systemics, Cybernetics and Informatics (SCI2000) and the 6th Internat. Conf. on Information Systems Analysis and Synthesis (ISAS2000), Orlando, Florida, USA, July 2000, International Institute of Informatics and Systemics: IIIS, Vol. VII, Computer Science and Engineering Part 1, 2000, pp. 418-423.
-
(2000)
Proc. Joint IIIS & IEEE Meeting of the 4th World Multiconference on Systemics, Cybernetics and Informatics (SCI2000) and the 6th Internat. Conf. on Information Systems Analysis and Synthesis (ISAS2000)
, vol.7
, pp. 418-423
-
-
Hitzler, P.1
Seda, A.K.2
-
26
-
-
9444248960
-
A note on the relationships between logic programs and neural networks
-
P. Gibson, D. Sinclair (Eds.), Maynooth, July, Electronic Workshops in Computing (eWiC), British Computer Society, Swindon, UK
-
P. Hitzler, A.K. Seda, A note on the relationships between logic programs and neural networks, in: P. Gibson, D. Sinclair (Eds.), Proc. 4th Irish Workshop on Formal Methods (IWFM'00), Maynooth, July 2000, Electronic Workshops in Computing (eWiC), British Computer Society, Swindon, UK, pp. 1-9.
-
(2000)
Proc. 4th Irish Workshop on Formal Methods (IWFM'00)
, pp. 1-9
-
-
Hitzler, P.1
Seda, A.K.2
-
27
-
-
0042895937
-
Unique supported-model classes of logic programs
-
International Information Institute
-
P. Hitzler, A.K. Seda, Unique supported-model classes of logic programs, Information, Vol. 4 (3), International Information Institute, 2001, pp. 295-302.
-
(2001)
Information
, vol.4
, Issue.3
, pp. 295-302
-
-
Hitzler, P.1
Seda, A.K.2
-
28
-
-
0041392844
-
On the coincidence of semantics for uniquely determined programs
-
T. Hurley, M. Mac an Airchinnigh, M. Schellekens, & A.K. Seda (Eds.), Proc. First Irish Conf. on the Mathematical Foundations of Computer Science and Information Technology, Cork, Ireland, July 2000, Amsterdam: Elsevier
-
Hitzler P., Seda A.K. On the coincidence of semantics for uniquely determined programs. Hurley T., Mac an Airchinnigh M., Schellekens M., Seda A.K. Proc. First Irish Conf. on the Mathematical Foundations of Computer Science and Information Technology, Cork, Ireland, July 2000. Electronic Notes in Theoretical Computer Science. Vol. 40:2001;1-17 Elsevier, Amsterdam.
-
(2001)
Electronic Notes in Theoretical Computer Science
, vol.40
, pp. 1-17
-
-
Hitzler, P.1
Seda, A.K.2
-
29
-
-
9444288398
-
Challenge problems for the integration of logic and connectionist systems
-
F. Bry, U. Geske, D. Seipel (Eds.), Würzburg, Germany, January 26-28, 2000, GMD Report 90
-
S. Hölldobler, Challenge problems for the integration of logic and connectionist systems in: F. Bry, U. Geske, D. Seipel (Eds.), Proc. 14th Workshop Logische Programmierung, Würzburg, Germany, January 26-28, 2000, GMD Report 90, 2000, pp. 161-170. This report is available at http://www.gmd.de/publications/report/0090/.
-
(2000)
Proc. 14th Workshop Logische Programmierung
, pp. 161-170
-
-
Hölldobler, S.1
-
30
-
-
0344671619
-
Approximating the semantics of logic programs by recurrent neural networks
-
Hölldobler S., Störr H., Kalinke Y. Approximating the semantics of logic programs by recurrent neural networks. Appl. Intell. 11:1999;45-58.
-
(1999)
Appl. Intell.
, vol.11
, pp. 45-58
-
-
Hölldobler, S.1
Störr, H.2
Kalinke, Y.3
-
31
-
-
0042394971
-
A New Method of Proving the Existence of answer sets for disjunctive logic programs: A metric fixed-point theorem for multivalued mappings
-
C. Baral, M. Gelfond (Eds.), Vancouver, B.C., Canada, October
-
M.A. Khamsi, V. Kreinovich, D. Misane, A New Method of Proving the Existence of answer sets for disjunctive logic programs: a metric fixed-point theorem for multivalued mappings, in: C. Baral, M. Gelfond (Eds.), Proc. Workshop on logic programming with Incomplete Information, Vancouver, B.C., Canada, October 1993, pp. 58-73.
-
(1993)
Proc. Workshop on Logic Programming with Incomplete Information
, pp. 58-73
-
-
Khamsi, M.A.1
Kreinovich, V.2
Misane, D.3
-
33
-
-
0041392845
-
Metric domains for completeness
-
Ph.D. Thesis, 1985, Department of Computer Science, University of Warwick, UK, April
-
S.G. Matthews, Metric domains for completeness, Ph.D. Thesis, 1985, Research Report 76, Department of Computer Science, University of Warwick, UK, April, 1986.
-
(1986)
Research Report
, vol.76
-
-
Matthews, S.G.1
-
34
-
-
0028558872
-
Partial metric topology
-
Annals of the New York Academy of Sciences
-
S.G. Matthews, Partial Metric Topology, in: Proc. 8th Summer Conf. Topology and its Applications, Annals of the New York Academy of Sciences, Vol. 728, 1992, pp. 183-197.
-
(1992)
Proc. 8th Summer Conf. Topology and Its Applications
, vol.728
, pp. 183-197
-
-
Matthews, S.G.1
-
36
-
-
0001599027
-
On the declarative semantics of deductive databases and logic programs
-
J. Minker (Ed.), Los Altos, CA: Morgan Kaufmann
-
Przymusinski T.C. On the declarative semantics of deductive databases and logic programs. Minker J. Foundations of Deductive Databases and Logic Programming. 1988;193-216 Morgan Kaufmann, Los Altos, CA.
-
(1988)
Foundations of Deductive Databases and Logic Programming
, pp. 193-216
-
-
Przymusinski, T.C.1
-
37
-
-
0025389833
-
Weakly stratified logic programs
-
K.R. Apt (Ed.), special issue on Logical Foundations of Artificial Intelligence
-
H. Przymusinska, T.C. Przymusinski, Weakly stratified logic programs, in: K.R. Apt (Ed.), Fundamenta Informaticae, Vol. 13, 1990, pp. 51-65 (special issue on Logical Foundations of Artificial Intelligence).
-
(1990)
Fundamenta Informaticae
, vol.13
, pp. 51-65
-
-
Przymusinska, H.1
Przymusinski, T.C.2
-
38
-
-
49149147322
-
A logic for default reasoning
-
Reiter R. A logic for default reasoning. Artif. Intell. 13:1980;81-132.
-
(1980)
Artif. Intell.
, vol.13
, pp. 81-132
-
-
Reiter, R.1
-
39
-
-
0035895134
-
Clausal logic and logic programming in algebraic domains
-
Rounds W.C., Zhang G.-Q. Clausal logic and logic programming in algebraic domains. Inform. Comput. 171:2001;183-200.
-
(2001)
Inform. Comput.
, vol.171
, pp. 183-200
-
-
Rounds, W.C.1
Zhang, G.-Q.2
-
40
-
-
0030408301
-
Elements of generalized ultrametric domain theory
-
Rutten J.J.M.M. Elements of generalized ultrametric domain theory. Theoret. Comput. Sci. 170:1996;349-381.
-
(1996)
Theoret. Comput. Sci.
, vol.170
, pp. 349-381
-
-
Rutten, J.J.M.M.1
-
41
-
-
84974753180
-
Topology and the semantics of logic programs
-
Seda A.K. Topology and the semantics of logic programs. Fundamenta Informaticae. 24(4):1995;359-386.
-
(1995)
Fundamenta Informaticae
, vol.24
, Issue.4
, pp. 359-386
-
-
Seda, A.K.1
-
42
-
-
0030778243
-
Quasi-metrics and the semantics of logic programs
-
Seda A.K. Quasi-metrics and the semantics of logic programs. Fundamenta Informaticae. 29(1):1997;97-117.
-
(1997)
Fundamenta Informaticae
, vol.29
, Issue.1
, pp. 97-117
-
-
Seda, A.K.1
-
43
-
-
0042394972
-
Topology and iterates in computational logic
-
Proc. 12th Summer Conf. on Topology and its Applications: Special Session on Topology in Computer Science, Ontario, August 1997
-
A.K. Seda, P. Hitzler, Topology and iterates in computational logic, Proc. 12th Summer Conf. on Topology and its Applications: Special Session on Topology in Computer Science, Ontario, August 1997; Topology Proceedings, Vol. 22, Summer 1997, pp. 427-469.
-
(1997)
Topology Proceedings
, vol.22
, pp. 427-469
-
-
Seda, A.K.1
Hitzler, P.2
-
44
-
-
0042895940
-
Strictly level-decreasing logic programs
-
A. Butterfield, S. Flynn (Eds.), Cork, 1998, Electronic Workshops in Computing (eWiC), British Computer Society, Swindon, UK
-
A.K. Seda, P. Hitzler, Strictly level-decreasing logic programs, in: A. Butterfield, S. Flynn (Eds.), Proc. Second Irish Workshop on Formal Methods (IWFM'98), Cork, 1998, Electronic Workshops in Computing (eWiC), British Computer Society, Swindon, UK, 1999, pp. 1-18.
-
(1999)
Proc. Second Irish Workshop on Formal Methods (IWFM'98)
, pp. 1-18
-
-
Seda, A.K.1
Hitzler, P.2
-
45
-
-
85034837164
-
Quasi-uniformities: Reconciling domains with metric spaces
-
M. Main, A. Melton, M. Mislove, & D. Schmidt (Eds.), Mathematical Foundations of Programming Language Semantics, Berlin: Springer
-
Smyth M.B. Quasi-uniformities: reconciling domains with metric spaces. Main M., Melton A., Mislove M., Schmidt D. Mathematical Foundations of Programming Language Semantics. Lecture Notes in Computer Science. Vol. 198:1987;236-253 Springer, Berlin.
-
(1987)
Lecture Notes in Computer Science
, vol.198
, pp. 236-253
-
-
Smyth, M.B.1
-
46
-
-
0001818543
-
Totally bounded spaces and compact ordered spaces as domains of computation
-
G.M. Reed, A.W. Roscoe, & R.F. Wachter (Eds.), Oxford: Oxford University Press
-
Smyth M.B. Totally bounded spaces and compact ordered spaces as domains of computation. Reed G.M., Roscoe A.W., Wachter R.F. Topology and Category Theory in Computer Science. 1991;207-229 Oxford University Press, Oxford.
-
(1991)
Topology and Category Theory in Computer Science
, pp. 207-229
-
-
Smyth, M.B.1
-
50
-
-
0030654537
-
Complexity of power default reasoning
-
Warsaw, Poland, July 1997, IEEE Computer Society Press, Silverspring, MI
-
G.-Q. Zhang, W.C. Rounds, Complexity of power default reasoning, in: Proc. 12th Ann. IEEE Symp. on Logic in Computer Science, LICS'97, Warsaw, Poland, July 1997, IEEE Computer Society Press, Silverspring, MI, pp. 328-339.
-
(1997)
Proc. 12th Ann. IEEE Symp. on Logic in Computer Science, LICS'97
, pp. 328-339
-
-
Zhang, G.-Q.1
Rounds, W.C.2
-
51
-
-
84946727341
-
Power defaults (preliminary report)
-
J. Dix, U. Furbach, & A. Nerode (Eds.), Proc. Fourth Internat. Conf. Logic Programming and Non-Monotonic Reasoning (LPNMR'97), Dagstuhl, Germany, July 28-31, 1997. Berlin: Springer-Verlag
-
Zhang G.-Q., Rounds W.C. Power defaults (preliminary report). Dix J., Furbach U., Nerode A. Proc. Fourth Internat. Conf. Logic Programming and Non-Monotonic Reasoning (LPNMR'97), Dagstuhl, Germany, July 28-31, 1997. Lecture Notes in Computer Science. Vol. 1265:1997;152-169 Springer-Verlag, Berlin.
-
(1997)
Lecture Notes in Computer Science
, vol.1265
, pp. 152-169
-
-
Zhang, G.-Q.1
Rounds, W.C.2
-
52
-
-
0013453991
-
Semantics of logic programs and representation of Smyth powerdomain
-
K. Keimel, & G.-Q. et al. Zhang (Eds.), Domains and Processes (ISDT'99), Dordrecht: Kluwer Academic Publishers
-
Zhang G.-Q., Rounds W.C. Semantics of logic programs and representation of Smyth powerdomain. Keimel K., Zhang G.-Q.et al. Domains and Processes (ISDT'99). Series Semantic Structures in Computation. Vol. 1:2001;151-179 Kluwer Academic Publishers, Dordrecht.
-
(2001)
Series Semantic Structures in Computation
, vol.1
, pp. 151-179
-
-
Zhang, G.-Q.1
Rounds, W.C.2
|