The Well-Founded Semantics for General Logic Programs Export

@article{vangelder91wellfounded, abstract = {A general logic program (abbreviated to "program" hereafter) is a set of rules that have both positive and negative subgoals. It is common to view a deductive database as a general logic program consisting of rules (IDB) sitting above elementary relations (EDB, facts). It is desirable to associate one Herbrand model with a program and think of that model as the "meaning of the program," or its "declarative semantics." Ideally, queries directed to the program would be answered in accordance with ...}, author = {van Gelder, Allen and Ross, Kenneth and Schlipf, John S.}, citeulike-article-id = {580531}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.2340}, journal = {Journal of the ACM}, keywords = {logic, logic\_programming}, number = {3}, pages = {620--650}, posted-at = {2006-04-08 23:28:32}, priority = {0}, title = {The Well-Founded Semantics for General Logic Programs}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.2340}, volume = {38}, year = {1991} }

TY - JOUR ID - vangelder91wellfounded L3 - citeulike-article-id:580531 N2 - A general logic program (abbreviated to "program" hereafter) is a set of rules that have both positive and negative subgoals. It is common to view a deductive database as a general logic program consisting of rules (IDB) sitting above elementary relations (EDB, facts). It is desirable to associate one Herbrand model with a program and think of that model as the "meaning of the program," or its "declarative semantics." Ideally, queries directed to the program would be answered in accordance with ... IS - 3 JF - Journal of the ACM EP - 650 TI - The Well-Founded Semantics for General Logic Programs VL - 38 SP - 620 KW - logic KW - logic_programming AU - van Gelder, Allen AU - Ross, Kenneth AU - Schlipf, John PY - 1991/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.2340 ER -