Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8th ICLP 1991: Paris, France
- Koichi Furukawa:
Logic Programming, Proceedings of the Eigth International Conference, Paris, France, June 24-28, 1991. MIT Press 1991, ISBN 0-262-56058-5
Theory I
- Phan Minh Dung:
Negations as Hypotheses: An Abductive Foundation for Logic Programming. ICLP 1991: 3-17 - Marco A. Casanova, Andrea S. Hemerly, Ramiro A. de T. Guerreiro:
Explaining SLDNF Resolution with Non-Normal Defaults. ICLP 1991: 18-31 - Alessandra Di Pierro, Maurizio Martelli, Catuscia Palamidessi:
Negation as Instantitation: A New Rule for the Treatment of Negation in Logic Programming. ICLP 1991: 32-45
Program Analysis
- Kalyan Muthukumar, Manuel V. Hermenegildo:
Combined Determination of Sharing and Freeness of Program Variables through Abstract Interpretation. ICLP 1991: 49-63 - Baudouin Le Charlier, Kaninda Musumbu, Pascal Van Hentenryck:
A Generic Abstract Interpretation Algorithm and its Complexity Analysis. ICLP 1991: 64-78 - Michael Codish, Dennis Dams, Eyal Yardeni:
Derivation and Safety of an Abstract Unification Algorithm for Groundness and Aliasing Analysis. ICLP 1991: 79-93
High Order I
- Weidong Chen, David Scott Warren:
An Intensional Logic of (Multi-Arity) Set Abstractions. ICLP 1991: 97-110 - Agostino Dovier, Eugenio G. Omodeo, Enrico Pontelli, Gianfranco Rossi:
{log}: A Logic Programming Language with Finite Sets. ICLP 1991: 111-124
Implementation I
- Philippe Codognet, Thierry Sola:
Extending the WAM for Intelligent Backtracking. ICLP 1991: 127-141 - Ludek Matyska, Adriana Jergová, David Toman:
Register Allocation in WAM. ICLP 1991: 142-156 - Micha Meier:
Recursion versus Iteration in Prolog. ICLP 1991: 157-169
Application I
- Eugene J. Rollins, Jeannette M. Wing:
Specifications as Search Keys for Software Libraries. ICLP 1991: 173-187 - Jean-François Monin:
Real-size Compiler Writing Using Prolog with Arrows. ICLP 1991: 188-201 - Bruno Marre:
Toward Automatic Test Data Set Selection Using Algebraic Specifications and Logic Programming. ICLP 1991: 202-219
Constraints I
- Ugo Montanari, Francesca Rossi:
Perfect Relaxation in Constraint Logic Programming. ICLP 1991: 223-237 - Maurizio Gabbrielli, Giorgio Levi:
Modeling Answer Constraints in Constraint Logic Programs. ICLP 1991: 238-252
High Order II
- Dale Miller:
Unification of Simply Typed Lamda-Terms as Logic Programming. ICLP 1991: 255-269 - Masami Hagiya:
Higher-Order Unification as a Theorem Proving Procedure. ICLP 1991: 270-284 - Anthony S. K. Cheng, Peter J. Robinson, John Staples:
Higher Level Meta Programming in Qu-Prolog 3: 0. ICLP 1991: 285-298
Program Analysis II
- Kristof Verschaetse, Danny De Schreye:
Deriving Termination Proofs for Logic Programs, Using Abstract Procedures. ICLP 1991: 301-315 - Brian J. Ross, Alan Smaill:
An Algebraic Semantics of Prolog Program Termination. ICLP 1991: 316-330 - Michael Codish, Moreno Falaschi, Kim Marriott:
Suspension Analysis for Concurrent Logic Programs. ICLP 1991: 331-345
Extensions of LP
- Yael Moscowitz, Ehud Shapiro:
Lexical Logic Programs. ICLP 1991: 349-363 - Glenn Mansfield, Atsushi Togashi, Nobuhisa Miake, Shoichi Noguchi:
AMLOG-E: A New Approach towards Amalgamation. ICLP 1991: 364-378 - Eyal Yardeni, Thom W. Frühwirth, Ehud Shapiro:
Polymorphically Typed Logic Programs. ICLP 1991: 379-393
Theory II
- Daniele Turi:
Extending S-Models to Logic Programs with Negation. ICLP 1991: 397-411 - Yong Hu, Li-Yan Yuan:
Extended Well-Founded Model Semantics for General Logic Programs. ICLP 1991: 412-425
Implementation II
- Doug Palmer, Lee Naish:
NUA-Prolog: An Extension to the WAM for Parallel Andorra. ICLP 1991: 429-442 - Vítor Santos Costa, David H. D. Warren, Rong Yang:
The Andorra-I Preprocessor: Supporting Full Prolog on the Basic Andorra Model. ICLP 1991: 443-456 - Mark Korsloot, Evan Tick:
Compilation Techniques for Nondeterminate Flat Concurrent Logic Programming Languages. ICLP 1991: 457-471
Abduction
- Luís Moniz Pereira, Joaquim Nunes Aparício, José Júlio Alferes:
Nonmonotonic Reasoning with Well Founded Semantics. ICLP 1991: 475-489 - Katsumi Inoue:
Extended Logic Programs with Default Assumptions. ICLP 1991: 490-504 - Ken Satoh, Noboru Iwayama:
Computing Abduction by Using the TMS. ICLP 1991: 505-518
Application II
- Roland H. C. Yap:
Restriction Site Mapping in CLP(R). ICLP 1991: 521-534 - Hiroshi Fujita, Ryuzo Hasegawa:
A Model Generation Theorem Prover in KL1 Using a Ramified -Stack Algorithm. ICLP 1991: 535-548 - Peter B. Reintjes:
A Set of Tools for VHDL Design. ICLP 1991: 549-562
Uncertainty
- Raymond T. Ng, V. S. Subrahmanian:
A Semantical Framework for Supporting Subjective and Conditional Probabilities in Deductive Databases. ICLP 1991: 565-580 - Didier Dubois, Jérôme Lang, Henri Prade:
Towards Possibilistic Logic Programming. ICLP 1991: 581-595
Program Analysis III
- Saumya K. Debray, Nai-Wei Lin:
Automatic Complexity Analysis of Logic Programs. ICLP 1991: 599-613 - Jonathan M. Lever:
Proving Program Properties by Means of SLS-Resolution. ICLP 1991: 614-628 - Livio Colussi, Elena Marchiori:
Proving Correctness of Logic Programs Using Axiomatic Semantics. ICLP 1991: 629-642
Theory III
- Leo Bachmair, Harald Ganzinger:
Perfect Model Semantics for Logic Programs with Equality. ICLP 1991: 645-659 - José Alberto Fernández, Jack Minker:
Bottom-Up Evaluation of Hierarchical Disjunctive Deductive Databases. ICLP 1991: 660-675
Theory IV
- Hai-Ping Ko, Mark E. Nadel:
Substitution and Refutation Revisited. ICLP 1991: 679-692 - Hendrik Decker:
On Generalized Cover Axioms. ICLP 1991: 693-707
Theory V
- James Harland:
A Clausal Form for the Completion of Logic Programs. ICLP 1991: 711-725 - Teodor C. Przymusinski:
Well-Founded Completions of Logic Programs. ICLP 1991: 726-741
Constraints II
- Pascal Van Hentenryck, Yves Deville:
The Cardinality Operator: A New Logical Connective for Constraint Logic Programming. ICLP 1991: 745-759 - Donald A. Smith:
Constraint Operations for CLP(FT). ICLP 1991: 760-774 - Abderrahmane Aggoun, Nicolas Beldiceanu:
Overview of the CHIP Compiler System. ICLP 1991: 775-789
Implementation III
- Shyam Mudambi:
Performances of Aurora on NUMA Machines. ICLP 1991: 793-806 - Khayri A. M. Ali, Roland Karlsson:
Scheduling Or-Parallelism in Muse. ICLP 1991: 807-821
Implementation IV
- Vítor Santos Costa, David H. D. Warren, Rong Yang:
The Andorra-I Engine: A Parallel Implementation of the Basic Andorra Model. ICLP 1991: 825-839 - Arie Harsat, Ran Ginosar:
CARMEL-4: The Unify-Spawn Machine for FCP. ICLP 1991: 840-854
Implementation V
- Pascal Brisset, Olivier Ridoux:
Naïve Reverse Can be Linear. ICLP 1991: 857-870 - Bharat Jayaraman, Gopalan Nadathur:
Implementation Techniques for Scoping Constructs in Logic Programming. ICLP 1991: 871-886
Abstracts of Poster Sessions
- Stefan Böttcher:
On Transactions in Logic Programming Languages. ICLP 1991: 889 - Bernard Migault, François Rousselot, Laurent Cervoni:
Prolog as a Host Language. ICLP 1991: 890 - M. Puchhammer, R. Schlöglhofer:
A Rule-oriented FSM Design System with Prototyping Capabilities. ICLP 1991: 891 - Toshinori Watanabe, Keiko Komatsu:
Co-operative Hierarchical Layout Problem Solver on Parallel Inference Machine. ICLP 1991: 892
Abstracts of Invited Talks
- Robert A. Ballance, Susan L. Graham:
Incremental Consistency Maintenance for Interactive Applications. ICLP 1991: 895-909 - Robert A. Kowalski:
Legislation as Logic Programs. ICLP 1991: 910 - Dale Miller:
Logics for Logic Programming: A Tutorial. ICLP 1991: 911 - Bernard J. Robinet:
Logic Programming at IBM: From the Lab to the Customer. ICLP 1991: 912-921 - Roger S. Scowen:
An Overview of Prolog Standardization - Progress, Problems and Solutions. ICLP 1991: 922-936
Abstracts of Advanced Tutorials
- Hassan Aït-Kaci:
Warren's Abstract Machine. ICLP 1991: 939 - Patrick Cousot:
Abstract Interpretation of Logic Programs. ICLP 1991: 940 - Yves Deville, Leon Sterling, Pierre Deransart:
Software Development and Logic Programming. ICLP 1991: 941 - Gérard Ferrand:
Basic Concepts of Logic Programming and Prolog. ICLP 1991: 942 - Seif Haridi:
Parallel Logic Programming based on the Andorra Principle. ICLP 1991: 943 - Jean-Jacques Chabrier, Claudine Pradelles, Bruno Legeard:
Applications of Constraints Logic Programming Languages. ICLP 1991: 944 - Giorgio Levi:
On the Semantics of Logic Programs. ICLP 1991: 945 - António Porto:
Logic Programming Environments. ICLP 1991: 946 - Patrick Saint-Dizier:
Logic Programming for Language Processing. ICLP 1991: 947 - Taisuke Sato:
Full First Order Logic Programming and Truth Predicate. ICLP 1991: 948 - Kazuo Taki:
Parallel Programming and Large-scale Applications in the FGCS Project. ICLP 1991: 949
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 04:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
