| |
|
|
|
Registro Completo |
|
Biblioteca(s): |
Embrapa Agricultura Digital. |
|
Data corrente: |
06/09/1996 |
|
Data da última atualização: |
31/08/2007 |
|
Autoria: |
BOWEN, K. A.; KOWALSKI, R. A. |
|
Título: |
Amalgamating language and metalanguage in logic programming. |
|
Ano de publicação: |
1982 |
|
Fonte/Imprenta: |
In: CLARK, K. L.; TARNLUND, S.-A. (Ed.). Logic programming. London: Academic Press, 1982. |
|
Páginas: |
p.153-172. |
|
Idioma: |
Inglês |
|
Conteúdo: |
It is argued that present-day logic programming systems exhibit shortcomings which can be overcome by extending the original object language to include that portion of the metalanguage which deals with the object language probability relation. Such a system is sketched, and some of its applications and properties are presented. Logic programming systems have proven to be a powerful tool for computer science. These systems have been especially congenial for work in artificial intelligence and database management (cf. Gallaire and Minker, 1978; Kowalsky, 1979a). Inevitably, as with almost any system, shortcomings have been discovered. Central among these is the problem of managing the system's database of clauses. Simply put, it is this: the conceptual basis of logic programming is deduction from a single fixed theory, while many applications must deal with deduction from varying or alternative theories. Thus in maintenance over time of a simple relational database, tuples are added, deleted, or modified. Addition of a tuple to a relation corresponds to assertion of a simple unit clause. Here only one theory at a time is involved, but it changes over time. Moreover, the problem of maintaining integrity constraints amounts to testing the consistency of the proposed addition with the theory constituting the database. The need in this example is for an ability to explicitly refer to theories (i.e., collections of clauses) and to discuss derivability from thesetheories. Our approach is to construct a system which... MenosIt is argued that present-day logic programming systems exhibit shortcomings which can be overcome by extending the original object language to include that portion of the metalanguage which deals with the object language probability relation. Such a system is sketched, and some of its applications and properties are presented. Logic programming systems have proven to be a powerful tool for computer science. These systems have been especially congenial for work in artificial intelligence and database management (cf. Gallaire and Minker, 1978; Kowalsky, 1979a). Inevitably, as with almost any system, shortcomings have been discovered. Central among these is the problem of managing the system's database of clauses. Simply put, it is this: the conceptual basis of logic programming is deduction from a single fixed theory, while many applications must deal with deduction from varying or alternative theories. Thus in maintenance over time of a simple relational database, tuples are added, deleted, or modified. Addition of a tuple to a relation corresponds to assertion of a simple unit clause. Here only one theory at a time is involved, but it changes over time. Moreover, the problem of maintaining integrity constraints amounts to testing the consistency of the proposed addition with the theory constituting the database. The need in this example is for an ability to explicitly refer to theories (i.e., collections of clauses) and to discuss derivability from thesetheories. Our approa... Mostrar Tudo |
|
Categoria do assunto: |
-- |
|
Marc: |
LEADER 01966naa a2200145 a 4500
001 1003404
005 2007-08-31
008 1982 bl uuuu u00u1 u #d
100 1 $aBOWEN, K. A.
245 $aAmalgamating language and metalanguage in logic programming.
260 $c1982
300 $ap.153-172.
520 $aIt is argued that present-day logic programming systems exhibit shortcomings which can be overcome by extending the original object language to include that portion of the metalanguage which deals with the object language probability relation. Such a system is sketched, and some of its applications and properties are presented. Logic programming systems have proven to be a powerful tool for computer science. These systems have been especially congenial for work in artificial intelligence and database management (cf. Gallaire and Minker, 1978; Kowalsky, 1979a). Inevitably, as with almost any system, shortcomings have been discovered. Central among these is the problem of managing the system's database of clauses. Simply put, it is this: the conceptual basis of logic programming is deduction from a single fixed theory, while many applications must deal with deduction from varying or alternative theories. Thus in maintenance over time of a simple relational database, tuples are added, deleted, or modified. Addition of a tuple to a relation corresponds to assertion of a simple unit clause. Here only one theory at a time is involved, but it changes over time. Moreover, the problem of maintaining integrity constraints amounts to testing the consistency of the proposed addition with the theory constituting the database. The need in this example is for an ability to explicitly refer to theories (i.e., collections of clauses) and to discuss derivability from thesetheories. Our approach is to construct a system which...
700 1 $aKOWALSKI, R. A.
773 $tIn: CLARK, K. L.; TARNLUND, S.-A. (Ed.). Logic programming. London: Academic Press, 1982.
Download
Esconder MarcMostrar Marc Completo |
|
Registro original: |
Embrapa Agricultura Digital (CNPTIA) |
|
|
Biblioteca |
ID |
Origem |
Tipo/Formato |
Classificação |
Cutter |
Registro |
Volume |
Status |
URL |
Voltar
|
|
|
| Registros recuperados : 4 | |
| 1. |  | BRINGHENTI, C. F.; TESSMANN, A. L.; JARDIN, S. N.; KOWALSKI, R.; RIBEIRO, J. B.; PEIXOTO, J. O.; COUTINHO, L. L.; LEDUR, M. C. Qualificação e sequenciamento parcial do gene sparc de frangos de corte e postura. In: JORNADA DE INICIAÇÃO CIENTÍFICA UnC/EMBRAPA, 1., 2007, Concórdia. Anais. Concórdia: Unc : Embrapa Suínos e Aves, 2007. 1 CD-ROM. Projeto n. 16.00.30001-16| Tipo: Artigo em Anais de Congresso / Nota Técnica | Circulação/Nível: -- - -- |
| Biblioteca(s): Embrapa Suínos e Aves. |
|   |
| 2. | | KOWALSKI, R.; TESMANN, A. L; BRIGHENTI, F. C.; JARDIN, S. N.; RIBEIRO, J. B.; PEIXOTO, J. O.; COUTINHO, L. L.; LEDUR, M. C. Otimização das condições de amplificação de um fragmento do gene que codifica ferritina em galinhas. In: JORNADA DE INICIAÇÃO CIENTÍFICA UnC/EMBRAPA, 1., 2007, Concórdia. Anais. Concórdia: Unc : Embrapa Suínos e Aves, 2007. 1 CD-ROM. Projeto n. 16.00.30001-16| Tipo: Artigo em Anais de Congresso / Nota Técnica | Circulação/Nível: -- - -- |
| Biblioteca(s): Embrapa Suínos e Aves. |
| |
| 3. | | PINHEIRO, J. C. A.; SOUZA, C. E. S. DE; RIBEIRO, D. A.; SILVA, A. DE A.; SILVA, V. B. DA; SANTOS, A. T. L. DOS; FONSECA, V. J. A.; MACÊDO, D. G. DE; CRUZ, R. P. DA; BEZERRA, J. W. A.; MACHADO, A. J. T.; FREITAS, T. S. DE; BRITO, E. S. de; RIBEIRO, P. R. V.; COSTA, J. G. M. DA; COUTINHO, H. D. M.; KOWALSKA, G.; ROWINSKI, R.; KOWALSKI, R.; BRAGA, M. F. B. M. LC-MS analysis and antifungal activity of Turnera subulata Sm. Plants, v. 12, n. 415, 2023. 12 p.| Tipo: Artigo em Periódico Indexado | Circulação/Nível: A - 4 |
| Biblioteca(s): Embrapa Agroindústria Tropical; Embrapa Alimentos e Territórios. |
|  |
| 4. | | SANTOS, A. T. L. dos; CARNEIRO, J. N. P.; CRUZ, R. P. da; SALES, D. L.; PINHEIRO, J. C. A.; FREITAS, M. A. de; KERNTOPF, M. R.; DELMONDES, G. de A.; RIBEIRO, P. R. V.; BRITO, E. S. de; BATISTA, F. L. A.; MAGALHÃES, F. E. A.; PITA NETO, I. C.; BRAGA, M. F. B. M.; KOWALSKI, R.; KOWALSKA, G.; SZOPA, A.; BAJ, T.; COUTINHO, H. D. M. UPLC-MS-ESI-QTOF analysis and antifungal activity of aqueous extracts of Spondias tuberosa. Molecules, Basel, v. 28, n. 1, art. 305, Jan. 2023. 14 p.| Tipo: Artigo em Periódico Indexado | Circulação/Nível: A - 2 |
| Biblioteca(s): Embrapa Agroindústria Tropical; Embrapa Alimentos e Territórios. |
| |
| Registros recuperados : 4 | |
|
| Nenhum registro encontrado para a expressão de busca informada. |
|
|
