An algebraic semantics of sequential Prolog control

Abstract: "This work introduces a new algebraic semantics of sequential Prolog. The semantics is based on a process interpretation of logic program computation, and is written in Milner's Calculus of Communicating Systems (CCS) [Mil89]. The motivation for this semantics is that meta-interp...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ross, Brian J. (VerfasserIn), Wilk, Paul F. (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Edinburgh 1990
Schriftenreihe:University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 469
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!

MARC

LEADER 00000nam a2200000 cb4500
001 BV010451585
003 DE-604
005 00000000000000.0
007 t
008 951026s1990 |||| 00||| engod
035 |a (OCoLC)22285565 
035 |a (DE-599)BVBBV010451585 
040 |a DE-604  |b ger  |e rakddb 
041 0 |a eng 
049 |a DE-91G 
100 1 |a Ross, Brian J.  |e Verfasser  |4 aut 
245 1 0 |a An algebraic semantics of sequential Prolog control  |c Brian J. Ross ; Paul F. Wilk 
264 1 |a Edinburgh  |c 1990 
300 |a 40 S. 
336 |b txt  |2 rdacontent 
337 |b n  |2 rdamedia 
338 |b nc  |2 rdacarrier 
490 1 |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper  |v 469 
520 3 |a Abstract: "This work introduces a new algebraic semantics of sequential Prolog. The semantics is based on a process interpretation of logic program computation, and is written in Milner's Calculus of Communicating Systems (CCS) [Mil89]. The motivation for this semantics is that meta-interpretive and denotational semantics of Prolog are not useful as programming calculi, as the declarative semantics of source programs is lost within their abstract mathematical domains. Our approach, on the other hand, defines the operational semantics at the language level, while at the same time maintaining the first-order declarative interpretation of the program. The CCS semantics is presented in two stages, first showing how Prolog's control mechanism is axiomatised, and then showing how dataflow is handled 
520 3 |a Program clauses and predicates have corresponding AND and OR agents derived for them, which are defined as CCS agent expressions. Two algebraic operators, '[symbol]' and '[symbol]', define the main control characteristics in Prolog, namely clause sequencing and goal backtracking respectively. We derive some algebraic properties of Prolog control using the CCS formalism. This semantics should prove useful as a calculus for logic program analysis. 
650 7 |a Computer software  |2 sigle 
650 7 |a Information theory  |2 sigle 
650 7 |a Mathematics  |2 sigle 
650 4 |a Mathematik 
650 4 |a Prolog (Computer program language) 
700 1 |a Wilk, Paul F.  |e Verfasser  |4 aut 
810 2 |a Department of Artificial Intelligence: DAI research paper  |t University <Edinburgh>  |v 469  |w (DE-604)BV010450646  |9 469 
999 |a oai:aleph.bib-bvb.de:BVB01-006964621 

Datensatz im Suchindex

DE-BY-TUM_call_number 0111/2001 B 6034-469
DE-BY-TUM_katkey 663752
DE-BY-TUM_media_number 040010001986
_version_ 1816711721516007424
any_adam_object
author Ross, Brian J.
Wilk, Paul F.
author_facet Ross, Brian J.
Wilk, Paul F.
author_role aut
aut
author_sort Ross, Brian J.
author_variant b j r bj bjr
p f w pf pfw
building Verbundindex
bvnumber BV010451585
ctrlnum (OCoLC)22285565
(DE-599)BVBBV010451585
format Book
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02424nam a2200361 cb4500</leader><controlfield tag="001">BV010451585</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951026s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22285565</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010451585</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ross, Brian J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An algebraic semantics of sequential Prolog control</subfield><subfield code="c">Brian J. Ross ; Paul F. Wilk</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">40 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">University &lt;Edinburgh&gt; / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">469</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This work introduces a new algebraic semantics of sequential Prolog. The semantics is based on a process interpretation of logic program computation, and is written in Milner's Calculus of Communicating Systems (CCS) [Mil89]. The motivation for this semantics is that meta-interpretive and denotational semantics of Prolog are not useful as programming calculi, as the declarative semantics of source programs is lost within their abstract mathematical domains. Our approach, on the other hand, defines the operational semantics at the language level, while at the same time maintaining the first-order declarative interpretation of the program. The CCS semantics is presented in two stages, first showing how Prolog's control mechanism is axiomatised, and then showing how dataflow is handled</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Program clauses and predicates have corresponding AND and OR agents derived for them, which are defined as CCS agent expressions. Two algebraic operators, '[symbol]' and '[symbol]', define the main control characteristics in Prolog, namely clause sequencing and goal backtracking respectively. We derive some algebraic properties of Prolog control using the CCS formalism. This semantics should prove useful as a calculus for logic program analysis.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Information theory</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematics</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Prolog (Computer program language)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wilk, Paul F.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University &lt;Edinburgh&gt;</subfield><subfield code="v">469</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">469</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006964621</subfield></datafield></record></collection>
id DE-604.BV010451585
illustrated Not Illustrated
indexdate 2024-11-25T17:14:19Z
institution BVB
language English
oai_aleph_id oai:aleph.bib-bvb.de:BVB01-006964621
oclc_num 22285565
open_access_boolean
owner DE-91G
DE-BY-TUM
owner_facet DE-91G
DE-BY-TUM
physical 40 S.
publishDate 1990
publishDateSearch 1990
publishDateSort 1990
record_format marc
series2 University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
spellingShingle Ross, Brian J.
Wilk, Paul F.
An algebraic semantics of sequential Prolog control
Computer software sigle
Information theory sigle
Mathematics sigle
Mathematik
Prolog (Computer program language)
title An algebraic semantics of sequential Prolog control
title_auth An algebraic semantics of sequential Prolog control
title_exact_search An algebraic semantics of sequential Prolog control
title_full An algebraic semantics of sequential Prolog control Brian J. Ross ; Paul F. Wilk
title_fullStr An algebraic semantics of sequential Prolog control Brian J. Ross ; Paul F. Wilk
title_full_unstemmed An algebraic semantics of sequential Prolog control Brian J. Ross ; Paul F. Wilk
title_short An algebraic semantics of sequential Prolog control
title_sort an algebraic semantics of sequential prolog control
topic Computer software sigle
Information theory sigle
Mathematics sigle
Mathematik
Prolog (Computer program language)
topic_facet Computer software
Information theory
Mathematics
Mathematik
Prolog (Computer program language)
volume_link (DE-604)BV010450646
work_keys_str_mv AT rossbrianj analgebraicsemanticsofsequentialprologcontrol
AT wilkpaulf analgebraicsemanticsofsequentialprologcontrol