-
Slim Abdennadher,
Ekkerhard Krämer,
Matthias Saft,
and Matthias Schmauss.
JACK: A Java Constraint Kit.
In M. Hanus, editor,
WFLP '01: Proc. 10th Intl. Workshop on Functional and (Constraint) Logic Programming, Selected Papers,
volume 64 of Electronic Notes in Theoretical Computer Science,
pages 1-17,
November 2002.
Elsevier.
Note: See also http://pms.ifi.lmu.de/software/jack/.
Keyword(s): Java.
@inproceedings{abd_kr_saft_schm_jack_wflp01:entcs02,
author = {Slim Abdennadher and Ekkerhard Kr{\"a}mer and Matthias Saft and Matthias Schmau\ss{}},
title = {{JACK}: A {J}ava {C}onstraint {K}it},
keywords = {Java},
pages = {1--17},
crossref = {pwflp01:entcs02},
note = {See also { t http://pms.ifi.lmu.de/software/jack/}},
}
-
Sandra Alves and Mario Florido.
Type Inference using Constraint Handling Rules.
In M. Hanus, editor,
WFLP '01: Proc. 10th Intl. Workshop on Functional and (Constraint) Logic Programming, Selected Papers,
volume 64 of Electronic Notes in Theoretical Computer Science,
pages 56-72,
November 2002.
Elsevier.
Keyword(s): type systems.
@inproceedings{alves_florido_type_inference_chr_wflp01:entcs02,
author = "Sandra Alves and Mario Florido",
title = "Type Inference using {C}onstraint {H}andling {R}ules",
keywords = {type systems},
pages = {56--72},
crossref = {pwflp01:entcs02}
}
-
Liviu Badea and Doina Tilivea.
Intelligent Information Integration as a Constraint Handling Problem.
In FQAS '02: Proc. 5th Intl. Conf. on Flexible Query Answer Systems,
volume 2522 of Lecture Notes in Computer Science,
October 2002.
Springer-Verlag.
[doi:10.1007/3-540-36109-X_2]
Abstract: |
Intelligent Information Integration (I3) aims at combining heterogeneous and distributed information sources by explicitly representing and reasoning about their content, giving the user the illusion of interacting with a uniform system. In this paper we show how query planning in such a system can be reduced to a constraint handling problem. Conceptually, our approach relies on a generalized abductive reasoning mechanism involving so called partially open predicates, which support a seamless combination of backward (goal-directed) and forward reasoning. The original aspects of our approach consist in the early detection of (plan) inconsistencies using forward propagation of constraints as well as in the seamless interleaving of query planning and execution. Unlike other specialized query planning algorithms, for which domain reasoning and query planning are only loosely coupled, our encoding of source and domain models into Constraint Handling Rules allows us to fully and efficiently exploit existing domain knowledge. The ability to automatically derive source interactions from domain models (ontologies) enhances the flexibility of modeling. |
@inproceedings{bedea_tilivea_iii_fqas02,
author = {Liviu Badea and Doina Tilivea},
title = {Intelligent Information Integration as a Constraint Handling Problem},
booktitle = {FQAS '02: Proc.\ 5th Intl.\ Conf.\ on Flexible Query Answer Systems},
year = 2002,
month = oct,
city = {Copenhagen, Denmark},
location = {Copenhagen, Denmark},
publisher = SV,
series = LNCS,
volume = {2522},
abstract = { Intelligent Information Integration (I3) aims at combining heterogeneous and distributed information sources by explicitly representing and reasoning about their content, giving the user the illusion of interacting with a uniform system. In this paper we show how query planning in such a system can be reduced to a constraint handling problem. Conceptually, our approach relies on a generalized abductive reasoning mechanism involving so called partially open predicates, which support a seamless combination of backward (goal-directed) and forward reasoning. The original aspects of our approach consist in the early detection of (plan) inconsistencies using forward propagation of constraints as well as in the seamless interleaving of query planning and execution. Unlike other specialized query planning algorithms, for which domain reasoning and query planning are only loosely coupled, our encoding of source and domain models into Constraint Handling Rules allows us to fully and efficiently exploit existing domain knowledge. The ability to automatically derive source interactions from domain models (ontologies) enhances the flexibility of modeling. },
doi = {10.1007/3-540-36109-X_2},
}
-
Sebastian Brand.
A Note on Redundant Rules in Rule-based Constraint Programming.
In Joint ERCIM/CologNet Intl. Workshop on Constraint Solving and Constraint Logic Programming, Selected papers,
volume 2627 of Lecture Notes in Computer Science,
pages 279-336,
June 2002.
Springer-Verlag.
Keyword(s): optimizing compilation.
@inproceedings{brand_redundant_rules_csclp02,
author = {Sebastian Brand},
title = {A Note on Redundant Rules in Rule-based Constraint Programming},
keywords = {optimizing compilation},
booktitle = {Joint ERCIM/CologNet Intl.\ Workshop on Constraint Solving and Constraint Logic Programming, Selected papers},
location = {Cork, Ireland},
city = {Cork, Ireland},
month = jun,
series = LNCS,
volume = 2627,
pages = {279--336},
year = 2002,
publisher = SV,
}
-
Aykut Firat,
Stuart Madnick,
and Benjamin Grosof.
Financial information integration in the presence of equational ontological conflicts.
In Proc. 12th Workshop Information Technologies and Systems,
2002.
Abstract: |
While there are efforts to establish a single international accounting standard, there are strong current and future needs to handle heterogeneous accounting methods and systems. We advocate a context-based approach to dealing with multiple accounting standards and equational ontological conflicts. In this paper we first define what we mean by equational ontological conflicts and then describe a new approach, using Constraint Logic Programming and abductive reasoning, to reconcile such conflicts among disparate information systems. In particular, we focus on the use of Constraint Handling Rules as a simultaneous symbolic equation solver, which is a powerful way to combine, invert and simplify multiple conversion functions that translate between different contexts. Finally, we demonstrate a sample application using our prototype implementation that demonstrates the viability of our approach. |
@inproceedings{financ_info_integration_wits02,
author = {Firat, Aykut and Madnick, Stuart and Grosof, Benjamin},
title = {Financial information integration in the presence of equational ontological conflicts},
booktitle = {Proc.\ 12th Workshop Information Technologies and Systems},
year = 2002,
location = {Barcelona, Spain},
city = {Barcelona, Spain},
abstract = { While there are efforts to establish a single international accounting standard, there are strong current and future needs to handle heterogeneous accounting methods and systems. We advocate a context-based approach to dealing with multiple accounting standards and equational ontological conflicts. In this paper we first define what we mean by equational ontological conflicts and then describe a new approach, using Constraint Logic Programming and abductive reasoning, to reconcile such conflicts among disparate information systems. In particular, we focus on the use of Constraint Handling Rules as a simultaneous symbolic equation solver, which is a powerful way to combine, invert and simplify multiple conversion functions that translate between different contexts. Finally, we demonstrate a sample application using our prototype implementation that demonstrates the viability of our approach. },
}
-
Thom Frühwirth.
As Time Goes By II: More Automatic Complexity Analysis of Concurrent Rule Programs.
In A. Di Pierro and H. Wiklicky, editors,
QAPL '01: Proc. First Intl. Workshop on Quantitative Aspects of Programming Languages,
volume 59(3) of Electronic Notes in Theoretical Computer Science,
2002.
Elsevier.
Keyword(s): complexity.
@inproceedings{fru_complexity2_entcs02,
AUTHOR = {Thom Fr{\"u}hwirth},
TITLE = {As Time Goes By {II}: More Automatic Complexity Analysis of Concurrent Rule Programs},
series = ENTCS,
volume = {59(3)},
year = 2002,
keywords = {complexity},
editor = {A. Di Pierro and H. Wiklicky},
publisher = Elsevier,
booktitle = {QAPL '01: Proc.\ First Intl.\ Workshop on Quantitative Aspects of Programming Languages},
location = {Florence, Italy},
city = {Florence, Italy},
}
-
Thom Frühwirth.
As Time Goes By: Automatic Complexity Analysis of Simplification Rules.
In D. Fensel,
F. Giunchiglia,
D. McGuinness,
and M.-A. Williams, editors,
KR '02: Proc. 8th Intl. Conf. Princ. Knowledge Representation and Reasoning,
pages 547-557,
April 2002.
Morgan Kaufmann.
Keyword(s): complexity.
@InProceedings{fru_complexity_kr02,
author = "Thom Fr{\"u}hwirth",
title = "As Time Goes By: Automatic Complexity Analysis of Simplification Rules",
pages = "547--557",
editor = "D. Fensel and F. Giunchiglia and D. McGuinness and M.-A. Williams",
booktitle = "KR '02: Proc.\ 8th Intl.\ Conf. Princ.\ Knowledge Representation and Reasoning",
month = apr,
keywords = {complexity},
publisher = MK,
year = "2002",
location = {Toulouse, France},
city = {Toulouse, France},
}
-
Thom Frühwirth,
Alessandra Di Pierro,
and Herbert Wiklicky.
Probabilistic Constraint Handling Rules.
In M. Comini and M. Falaschi, editors,
WFLP '02: Proc. 11th Intl. Workshop on Functional and (Constraint) Logic Programming, Selected Papers,
volume 76 of Electronic Notes in Theoretical Computer Science,
June 2002.
Elsevier.
Keyword(s): probabilistic CHR,
extensions.
@inproceedings{fru_dipierro_wiklicky_probabilistic_chr_wflp02,
AUTHOR = {Thom Fr{\"u}hwirth and Di Pierro, Alessandra and Herbert Wiklicky},
TITLE = {Probabilistic {C}onstraint {H}andling {R}ules},
keywords = {probabilistic CHR, extensions},
EDITOR = {Comini, M. and Falaschi, M.},
booktitle = {WFLP '02: Proc.\ 11th Intl.\ Workshop on Functional and (Constraint) Logic Programming, Selected Papers},
series = ENTCS,
VOLUME = 76,
YEAR = 2002,
month = jun,
publisher = Elsevier,
location = {Grado, Italy},
city = {Grado, Italy},
}
-
Harald Ganzinger and David A. McAllester.
Logical Algorithms.
In P. J. Stuckey, editor,
ICLP '02: Proc. 18th Intl. Conf. Logic Programming,
volume 2401 of Lecture Notes in Computer Science,
pages 209-223,
jul/aug 2002.
Springer-Verlag.
Keyword(s): related formalisms.
@inproceedings{ganzinger_mcallester_la_iclp02,
author = {Harald Ganzinger and David A. McAllester},
title = {Logical Algorithms},
keywords = {related formalisms},
pages = {209--223},
crossref = {piclp02}
}
-
Diego Garat and Dina Wonsever.
A Constraint Parser for Contextual Rules.
In Proc. 22nd Intl. Conf. of the Chilean Computer Science Society,
pages 234-242,
November 2002.
IEEE Computer Society.
@inproceedings{garat_wonsever_parser_contextual_rules_sccc02,
author = {Diego Garat and Dina Wonsever},
title = {A Constraint Parser for Contextual Rules},
month = nov,
year = 2002,
booktitle = {Proc.\ 22nd Intl.\ Conf.\ of the Chilean Computer Science Society},
pages = {234--242},
publisher = {IEEE Computer Society},
location = {Copiapo, Chile},
city = {Copiapo, Chile},
}
-
Michael J. Maher.
Propagation completeness of reactive constraints.
In P. J. Stuckey, editor,
ICLP '02: Proc. 18th Intl. Conf. Logic Programming,
volume 2401 of Lecture Notes in Computer Science,
pages 148-162,
jul/aug 2002.
Springer-Verlag.
@inproceedings{propagation_completeness_maher_iclp02,
author = {Michael J. Maher},
title = {Propagation completeness of reactive constraints},
pages = {148--162},
crossref = {piclp02},
}
-
Eduardo Torres Schumann.
A Literate Programming System for Logic Programs with Constraints.
In M. Comini and M. Falaschi, editors,
WFLP '02: Proc. 11th Intl. Workshop on Functional and (Constraint) Logic Programming,
University of Udine, Research Report UDMI/18/2002/RR,
2002.
@INPROCEEDINGS{torres_literate_programming_wflp02,
AUTHOR = {Eduardo Torres Schumann},
TITLE = {A Literate Programming System for Logic Programs with Constraints},
EDITOR = {Comini, M. and Falaschi, M.},
BOOKTITLE = {WFLP '02: Proc.\ 11th Intl.\ Workshop on Functional and (Constraint) Logic Programming},
YEAR = 2002,
location = {Grado, Italy},
city = {Grado, Italy},
series = {University of Udine, Research Report UDMI/18/2002/RR}
}
-
Christian Seitz,
Bernhard Bauer,
and Michael Berger.
Planning and Scheduling in Multi Agent Systems using Constraint Handling Rules.
In IC-AI '02: Proc. Intl. Conf. Artificial Intelligence,
June 2002.
CSREA Press.
@inproceedings{seitz_bauer_berger_MAS_icai02,
author = {Christian Seitz and Bernhard Bauer and Michael Berger},
title = {Planning and Scheduling in Multi Agent Systems using {C}onstraint {H}andling {R}ules},
booktitle = {IC-AI '02: Proc.\ Intl.\ Conf.\ Artificial Intelligence},
location = {Las Vegas, Nevada, USA},
city = {Las Vegas, Nevada, USA},
publisher = {CSREA Press},
month = jun,
year = 2002
}
-
Michael Thielscher.
Reasoning About Actions with CHRs and Finite Domain Constraints.
In P. J. Stuckey, editor,
ICLP '02: Proc. 18th Intl. Conf. Logic Programming,
volume 2401 of Lecture Notes in Computer Science,
pages 70-84,
jul/aug 2002.
Springer-Verlag.
@Inproceedings{thielscher_actions_iclp02,
author = "Michael Thielscher",
title = "Reasoning About Actions with {CHR}s and Finite Domain Constraints",
pages = "70--84",
crossref = {piclp02}
}