default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory and Practice of Logic Programming (TPLP), Volume 9
Volume 9, Number 1, January 2009
- Enrico Pontelli
, Tran Cao Son, Omar El-Khatib:
Justifications for logic programs under answer set semantics. 1-56 - Chitta Baral, Michael Gelfond, J. Nelson Rushton:
Probabilistic reasoning with answer sets. 57-144
Volume 9, Number 2, March 2009
- Étienne Payet, Frédéric Mesnard:
A non-termination criterion for binary constraint logic programs. 145-164 - Leslie De Koninck:
Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities. 165-212 - Sabrina Baselice, Piero A. Bonatti, Giovanni Criscuolo:
On finitely recursive programs. 213-238 - Femke van Raamsdonk:
Lambda-Calculus and Combinators, An Introduction, 2nd Edition, J. Roger Hindley and Jonathan P. Seldin, Cambridge University Press, 2008. Hardback, ISBN 9780521898850. 239-243
Volume 9, Number 3, May 2009
- Joost Vennekens, Marc Denecker, Maurice Bruynooghe:
CP-logic: A language of causal probabilistic events and its relation to logic programming. 245-308 - Van Hung Le, Fei Liu, Dinh Khang Tran:
Fuzzy linguistic logic programming and its applications. 309-341 - Gergely Lukácsy, Péter Szeredi:
Efficient description logic reasoning in Prolog: The DLog system. 343-414
Volume 9, Number 4, July 2009
- Sonia Estévez Martín, Maria Teresa Hortalá-González, Mario Rodríguez-Artalejo, Rafael del Vado Vírseda, Fernando Sáenz-Pérez, Antonio J. Fernández:
On the cooperation of the constraint domains , R, and F in CFLP. 415-527 - Yi-Dong Shen, Jia-Huai You, Li-Yan Yuan:
Characterizations of stable model semantics for logic programs with arbitrary constraint atoms. 529-564
Volume 9, Number 5, September 2009
- David Pearce, Hans Tompits, Stefan Woltran:
Characterising equilibrium logic and nested logic programs: Reductions and complexity, . 565-616 - Gianluca Amato, Francesca Scozzari:
Optimality in goal-dependent analysis of Sharing. 617-689
Volume 9, Number 6, November 2009
- Paolo Mancarella, Giacomo Terreni, Fariba Sadri, Francesca Toni, Ulle Endriss:
The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments. 691-750 - Yi-Dong Shen, Danny De Schreye, Dean Voets:
Termination prediction for general logic programs. 751-780 - Miroslaw Truszczynski, Stefan Woltran:
Relativized hyperequivalence of logic programs for modular programming. 781-819
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 2025-11-28 23:55 CET 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:
