


default search action
Theory and Practice of Logic Programming, Volume 25
Volume 25, Number 1, 2025
- Damiano Azzolini

, Fabrizio Riguzzi
:
Probabilistic Answer Set Programming with Discrete and Continuous Random Variables. 1-32 - Damiano Azzolini

, Elena Bellodi
, Rafael Kiesel, Fabrizio Riguzzi
:
Solving Decision Theory Problems with Probabilistic Answer Set Programming. 33-63 - Emanuele De Angelis

, Fabio Fioravanti
, Alberto Pettorossi
, Maurizio Proietti
:
Catamorphic Abstractions for Constrained Horn Clause Satisfiability. 64-91 - Francesco Chiariello, Valeria Fionda, Antonio Ielo, Francesco Ricca:

Direct Encoding of Declare Constraints in ASP. 92-131
Volume 25, Number 2, 2025
- Guido Governatori

, Anni-Yasmin Turhan
:
Introduction to the Special Issue on Logic Rules and Reasoning: Selected Papers From the 6th International Joint Conference on Rules and Reasoning (RuleML+RR 2022). 132-133 - Susana Hahn

, Tomi Janhunen
, Roland Kaminski
, Javier Romero
, Nicolas Rühling
, Torsten Schaub
:
Plingo: A System for Probabilistic Reasoning in Answer Set Programming. 134-167 - Luigi Bellomarini

, Livia Blasi
, Markus Nissl
, Emanuel Sallinger
:
The Temporal Vadalog System: Temporal Datalog-Based Reasoning. 168-196 - Javier Romero

, Torsten Schaub
, Klaus Strauch
:
On the Generalization of Learned Constraints for ASP Solving in Temporal Domains. 197-224 - Dingmin Wang, Bernardo Cuenca Grau

, Przemyslaw Andrzej Walega, Pan Hu
:
Practical Reasoning in DatalogMTL. 225-255
Volume 25, Number 3, 2025
- David Zhao

, Pavle Subotic, Mukund Raghothaman, Bernhard Scholz:
Provenance Guided Rollback Suggestions. 256-280 - Francesco Calimeri

, Giovambattista Ianni
, Francesco Pacenza
, Simona Perri
, Jessica Zangari
:
ASP-Based Multi-Shot Reasoning via DLV2 with Incremental Grounding. 281-303 - Dörthe Arndt

, Stephan Mennicke
:
Existential Notation3 Logic. 304-339 - Sascha Rechenberger

, Thom W. Frühwirth:
FreeCHR - An Algebraic Framework for Constraint Handling Rules Embeddings. 340-373 - Jordina Francès de Mas

, Juliana Bowles
:
A Novel Framework for Systematic Propositional Formula Simplification Based on Existential Graphs. 374-393
Volume 25, Number 4, 2025
- Martin Gebser, Daniela Inclezan, Francesco Ricca:

Introduction to the 41 $^{st}$ International Conference on Logic Programming Special Issue. 394-401 - Felicidad Aguado, Pedro Cabalar, Brais Muñiz, Gilberto Pérez, Concepción Vidal:

Comparing Non-Minimal Semantics for Disjunction in Answer Set Programming. 402-416 - Mario Alviano, Luis Angel Rodriguez Reiners, Wolfgang Faber:

ASP Chef Grows Mustache to Look Better. 417-436 - Damiano Azzolini, Marco Duca, Francesco Gallo, Antonio Ielo, Stefano Forti:

Application Placement with Constraint Relaxation. 437-454 - Damiano Azzolini, Fabrizio Riguzzi, Theresa Swift:

Integrating Belief Domains into Probabilistic Logic Programs. 455-472 - Lucia Balázová, Richard Comploi-Taupe, Susana Hahn, Nicolas Rühling, Gottfried Schenner:

Smart Expansion Techniques for ASP-Based Interactive Configuration. 473-488 - Alexander Beiser, Stefan Woltran, Markus Hecher:

Automated Hybrid Grounding Using Structural and Data-Driven Heuristics. 489-506 - Rachel Ben-Eliyahu-Zohary:

Splitting a Disjunctive Logic Program. 507-521 - Alessandro Bertagnon, Marcello Dalpasso, Michele Favalli, Marco Gavanelli:

Fine-Grained Timing Analysis of Digital Integrated Circuits in Answer Set Programming. 522-539 - Aysu Bogatarkan, Esra Erdem:

A General Framework for Dynamic MAPF Using Multi-Shot ASP and Tunnels. 540-557 - Pierangela Bruno, Carmine Dodaro, Giuseppe Galatà, Marco Maratea, Marco Mochi:

Improving ASP-Based ORS Schedules through Machine Learning Predictions. 558-578 - Pedro Cabalar, Martín Diéguez, François Olivier, Torsten Schaub, Igor Stéphan:

Towards Constraint Temporal Answer Set Programming. 579-594 - Angelos Charalambidis, Babis Kostopoulos, Christos Nomikos, Panos Rondogiannis:

The Power of Negation in Higher-Order Datalog. 595-611 - Marco Ciccalè, Daniel Jurjo-Rivas, José F. Morales, Pedro López-García, Manuel V. Hermenegildo:

Hiord $^{{\kern2pt}\sharp}$ : An Approach to the Specification and Verification of Higher-Order (C)LP Programs. 612-630 - Wlodzimierz Drabent:

On Systematic Construction of Correct Logic Programs. 631-648 - Thomas Eiter, Tobias Geibinger, Nysret Musliu, Johannes Oetsch, Tobias Kaminski:

ASP-FZN: A Translation-Based Constraint Answer Set Solver. 649-667 - Jorge Fandinno, Zachary Hansen, Yuliya Lierler, Christoph Glinzer, Jan Heuer, Torsten Schaub, Tobias Stolzmann, Vladimir Lifschitz:

ANTHEM 2.0: Automated Reasoning for Answer Set Programming. 668-684 - Müge Fidan, Esra Erdem:

Finding Personalized Good-Enough Solutions to Unsatisfiable Stable Roommates Problems. 685-702 - Mohimenul Kabir, Supratik Chakraborty, Kuldeep S. Meel:

Counting Answer Sets of Disjunctive Answer Set Programs. 703-721 - Parth Padalkar, Gopal Gupta:

Symbolic Rule Extraction From Attention-Guided Sparse Representations in Vision Transformers. 722-738 - Étienne Payet:

Non-Termination of Logic Programs Using Patterns. 739-755 - Enrico Santi, Agostino Dovier, Andrea Formisano, Fabio Tardivo:

GPU Accelerated Compact-Table Propagation. 756-774 - Johannes Schmidt, Mohamed Maizia, Victor Lagerkvist, Johannes Klaus Fichte:

Complexity of Faceted Explanations in Propositional Abduction. 775-793 - Alice Tarzariol, Marco Maratea, Mauro Vallati:

A CASP-Based Solution for Traffic Signal Optimisation. 794-812 - Baturay Yilmaz, Esra Erdem:

Generating Satisfiable Benchmark Instances for Stable Roommates Problems with Optimization. 813-828

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














