Philippe Codognet
Proceedings of the 17th International Conference on Logic Programming
ICLP, 2001.

@proceedings{ICLP-2001,
	address       = "Paphos, Cyprus",
	editor        = "Philippe Codognet",
	isbn          = "3-540-42935-2",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 17th International Conference on Logic Programming}",
	volume        = 2237,
	year          = 2001,
}

Contents (31 items)

8 ×#logic programming
6 ×#constraints
5 ×#source code
4 ×#semantics
3 ×#approach
3 ×#database
3 ×#logic
3 ×#multi
3 ×#prolog
2 ×#implementation

ICLP-2001-Colmerauer #approximate #constraints #multi

Solving the Multiplication Constraint in Several Approximation Spaces (AC), p. 1.

ICLP-2001-Kowalski #logic #question

Is Logic Really Dead or Only Just Sleeping? (RAK), pp. 2–3.

ICLP-2001-Cousot #abstract interpretation #design #program transformation #semantics

Design of Syntactic Program Transformations by Abstract Interpretation of Semantic Transformations (PC), pp. 4–5.

ICLP-2001-Gupta #named

X-tegration — Some Cross-Enterprise Thoughts (AG), p. 6.

ICLP-2001-Wielemaker #prolog

Building Real-Life Applications with Prolog (JW), p. 7.

ICLP-2001-Clergerie #natural language #parsing

Natural Language Tabular Parsing (EVdlC), p. 8.

ICLP-2001-Ueda #concurrent #constraints

A Close Look at Constraint-Based Concurrency (KU), p. 9.

ICLP-2001-Subrahmanian #database #logic programming #probability

Probabilistic Databases and Logic Programming (VSS), p. 10.

ICLP-2001-CastroC #comprehension #memory management #prolog

Understanding Memory Management in Prolog Systems (LFC, VSC), pp. 11–26.

ICLP-2001-VillaverdePGG #architecture #implementation #named #prolog

PALS: An Or-Parallel Implementation of Prolog on Beowulf Architectures (KV, EP, HFG, GG), pp. 27–42.

ICLP-2001-RochaSC #on the

On a Tabling Engine That Can Exploit Or-Parallelism (RR, FMAS, VSC), pp. 43–58.

ICLP-2001-BeldiceanuC #constraints #product line

Revisiting the Cardinality Operator and Introducing the Cardinality-Path Constraint Family (NB, MC), pp. 59–73.

ICLP-2001-HolzbaurBJS #compilation #constraints #optimisation

Optimizing Compilation of Constraint Handling Rules (CH, MJGdlB, DJ, PJS), pp. 74–89.

ICLP-2001-BandaJMNSH #constraints #theorem proving

Building Constraint Solvers with HAL (MJGdlB, DJ, KM, NN, PJS, CH), pp. 90–104.

ICLP-2001-MazurRJB #aspect-oriented #garbage collection

Practical Aspects for a Working Compile Time Garbage Collection System for Mercury (NM, PR, GJ, MB), pp. 105–119.

ICLP-2001-HoweK #multi

Positive Boolean Functions as Multiheaded Clauses (JMH, AK), pp. 120–134.

ICLP-2001-CodishGSS #analysis

Higher-Precision Groundness Analysis (MC, SG, HS, PJS), pp. 135–149.

ICLP-2001-GuoRR

Speculative Beats Conservative Justification (HFG, CRR, IVR), pp. 150–165.

ICLP-2001-BasuMRRV #bisimulation #constraints #logic programming #using

Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming (SB, MM, CRR, IVR, RMV), pp. 166–180.

ICLP-2001-GuoG #implementation #logic programming #order

A Simple Scheme for Implementing Tabled Logic Programming Systems Based on Dynamic Reordering of Alternatives (HFG, GG), pp. 181–196.

ICLP-2001-LoncT #complexity #logic programming #parametricity #semantics #source code

Fixed-Parameter Complexity of Semantics for Logic Programs (ZL, MT), pp. 197–211.

ICLP-2001-DeneckerPB #logic programming #semantics #source code

Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates (MD, NP, MB), pp. 212–226.

ICLP-2001-KumarRS #equation #fixpoint #modelling

Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models (KNK, CRR, SAS), pp. 227–241.

ICLP-2001-ErdemL #source code #theorem

Fages’ Theorem for Programs with Nested Expressions (EE, VL), pp. 242–254.

ICLP-2001-OrejasPP #embedded #logic programming #semantics #source code

Semantics of Normal Logic Programs with Embedded Implications (FO, EP, EP), pp. 255–268.

ICLP-2001-MedinaOV #abduction #approach #logic #multi #reasoning

A Multi-adjoint Logic Approach to Abductive Reasoning (JM, MOA, PV), pp. 269–283.

ICLP-2001-DrabentM #approach #correctness #declarative #proving #source code

Proving Correctness and Completeness of Normal Programs — A Declarative Approach (WD, MM), pp. 284–299.

ICLP-2001-KaneiwaT #order

An Order-Sorted Resolution with Implicitly Negative Sorts (KK, ST), pp. 300–314.

ICLP-2001-BanbaraKHT #linear #logic programming

Logic Programming in a Fragment of Intuitionistic Temporal Linear Logic (MB, KSK, TH, NT), pp. 315–330.

ICLP-2001-Almendros-JimenezBS #database #deduction #functional #logic

A Computational Model for Functional Logic Deductive Databases (JMAJ, ABT, JSH), pp. 331–347.

ICLP-2001-GrecoGZ #approach #consistency #database #integration #logic programming #query

A Logic Programming Approach to the Integration, Repairing and Querying of Inconsistent Databases (GG, SG, EZ), pp. 348–364.