default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12. LPNMR 2013: Corunna, Spain
- Pedro Cabalar, Tran Cao Son:
Logic Programming and Nonmonotonic Reasoning, 12th International Conference, LPNMR 2013, Corunna, Spain, September 15-19, 2013. Proceedings. Lecture Notes in Computer Science 8148, Springer 2013, ISBN 978-3-642-40563-1 - Gerhard Brewka:
Towards Reactive Multi-Context Systems. 1-10 - Robert A. Kowalski:
Logic Programming in the 1970s. 11-22 - Felicidad Aguado, Gilberto Pérez, Concepción Vidal
:
Integrating Temporal Extensions of Answer Set Programming. 23-35 - José Júlio Alferes, Matthias Knorr, Kewen Wang:
Forgetting under the Well-Founded Semantics. 36-41 - Mario Alviano, Francesco Calimeri, Günther Charwat, Minh Dao-Tran, Carmine Dodaro, Giovambattista Ianni, Thomas Krennwallner, Martin Kronegger, Johannes Oetsch, Andreas Pfandler, Jörg Pührer, Christoph Redl, Francesco Ricca, Patrik Schneider, Martin Schwengerer, Lara Katharina Spendier, Johannes Peter Wallner, Guohui Xiao:
The Fourth Answer Set Programming Competition: Preliminary Report. 42-53 - Mario Alviano, Carmine Dodaro, Wolfgang Faber, Nicola Leone, Francesco Ricca:
WASP: A Native ASP Solver Based on Constraint Learning. 54-66 - Mario Alviano, Wolfgang Faber:
The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics. 67-72 - Thomas Ambroz, Günther Charwat, Andreas Jusits, Johannes Peter Wallner, Stefan Woltran:
ARVis: Visualizing Relations between Answer Sets. 73-78 - Benjamin Andres, Martin Gebser, Torsten Schaub, Christian Haubelt, Felix Reimann, Michael Glaß:
Symbolic System Synthesis Using Answer Set Programming. 79-91 - Benjamin Andres, Matthias Sauer, Martin Gebser, Tobias Schubert, Bernd Becker, Torsten Schaub:
Accurate Computation of Sensitizable Paths Using Answer Set Programming. 92-101 - Christian Antic, Thomas Eiter, Michael Fink:
Hex Semantics via Approximation Fixpoint Theory. 102-115 - Saadat Anwar, Chitta Baral, Katsumi Inoue:
Encoding Higher Level Extensions of Petri Nets in Answer Set Programming. 116-121 - Joseph Babb, Joohyung Lee:
Cplus 2ASP: Computing Action Language ${\cal C}$ + in Answer Set Programming. 122-134 - Evgenii Balai, Michael Gelfond, Yuanlin Zhang:
Towards Answer Set Programming with Sorts. 135-147 - Marcello Balduccini, Yuliya Lierler, Peter Schüller:
Prolog and ASP Inference under One Roof. 148-160 - Chitta Baral, Nguyen Ha Vo:
Event-Object Reasoning with Curated Knowledge Bases: Deriving Missing Information. 161-167 - Rosamaria Barilaro, Michael Fink, Francesco Ricca, Giorgio Terracina:
Towards Query Answering in Relational Multi-Context Systems. 168-173 - Ringo Baumann, Gerhard Brewka:
Spectra in Abstract Argumentation: An Analysis of Minimal Change. 174-186 - Jori Bomanson, Tomi Janhunen:
Normalizing Cardinality Rules Using Merging and Sorting Constructions. 187-199 - Daniel Borchmann:
Experience Based Nonmonotonic Reasoning. 200-205 - Philippe Bordron, Damien Eveillard, Alejandro Maass, Anne Siegel, Sven Thiele:
An ASP Application in Integrative Biology: Identification of Functional Gene Units. 206-218 - Timothy Joseph Cerexhe, Orkunt Sabuncu, Michael Thielscher:
Evaluating Answer Set Clause Learning for General Game Playing. 219-232 - Günther Charwat, Giovambattista Ianni, Thomas Krennwallner, Martin Kronegger, Andreas Pfandler, Christoph Redl, Martin Schwengerer, Lara Katharina Spendier, Johannes Peter Wallner, Guohui Xiao:
VCWC: A Versioning Competition Workflow Compiler. 233-238 - Wu Chen, Dongmo Zhang, Maonian Wu:
A Sequential Model for Reasoning about Bargaining in Logic Programs. 239-244 - Guillaume Collet, Damien Eveillard, Martin Gebser, Sylvain Prigent, Torsten Schaub, Anne Siegel, Sven Thiele:
Extending the Metabolic Network of Ectocarpus Siliculosus Using Answer Set Programming. 245-256 - Stefania Costantini, Andrea Formisano:
Negation as a Resource: A Novel View on Answer Set Semantics. 257-263 - James P. Delgrande, Pavlos Peppas, Stefan Woltran:
AGM-Style Belief Revision of Logic Programs under Answer Set Semantics. 264-276 - Christian Drescher, Toby Walsh:
Efficient Approximation of Well-Founded Justification and Well-Founded Domination. 277-289 - Manfred Eppe, Mehul Bhatt, Frank Dylla:
Approximate Epistemic Planning with Postdiction as Answer-Set Programming. 290-303 - Luis Fariñas del Cerro, Andreas Herzig, Ezgi Iraz Su:
Combining Equilibrium Logic and Dynamic Logic. 304-316 - Michael Fink, Stefano Germano, Giovambattista Ianni, Christoph Redl, Peter Schüller:
ActHEX: Implementing HEX Programs with Action Atoms. 317-322 - Melanie Frühstück, Jörg Pührer, Gerhard Friedrich:
Debugging Answer-Set Programs with Ouroboros - Extending the SeaLion Plugin. 323-328 - Chrysida Galanaki, Christos Nomikos, Panos Rondogiannis:
Game Semantics for Non-monotonic Intensional Logic Programming. 329-341 - Martin Gebser, Thomas Glase, Orkunt Sabuncu, Torsten Schaub:
Matchmaking with Answer Set Programming. 342-347 - Martin Gebser, Holger Jost, Roland Kaminski, Philipp Obermeier, Orkunt Sabuncu, Torsten Schaub, Marius Schneider:
Ricochet Robots: A Transverse ASP Benchmark. 348-360 - Ricardo Gonçalves, José Júlio Alferes:
Decidability and Implementation of Parametrized Logic Programs. 361-373 - Ricardo Gonçalves, Matthias Knorr, João Leite, Martin Slota:
Non-monotonic Temporal Goals. 374-386 - Amelia Harrison, Vladimir Lifschitz, Miroslaw Truszczynski:
On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics. 387-394 - Daniela Inclezan:
An Application of ASP to the Field of Second Language Acquisition. 395-400 - Jianmin Ji, Fangzhen Lin:
Turner's Logic of Universal Causation, Propositional Logic, and Logic Programming. 401-413 - Markus Krötzsch, Despoina Magka, Ian Horrocks:
Concrete Results on Abstract Rules. 414-426 - Chris Martens, Anne-Gwenn Bosser, João F. Ferreira, Marc Cavazza:
Linear Logic Programming for Narrative Generation. 427-432 - Artur Mikitiuk, Miroslaw Truszczynski:
Implementing Informal Semantics of ASP. 433-438 - Maurice Pagnucco, David Rajaratnam, Hannes Strass, Michael Thielscher:
Implementing Belief Change in the Situation Calculus and an Application. 439-451 - Axel Polleres, Melanie Frühstück, Gottfried Schenner, Gerhard Friedrich:
Debugging Non-ground ASP Programs with Choice Rules, Cardinality and Weight Constraints. 452-464 - Anna Ryabokon, Gerhard Friedrich, Andreas A. Falkner:
Conflict-Based Program Rewriting for Solving Configuration Problems. 465-478 - Ari Saptawijaya, Luís Moniz Pereira:
Program Updating by Incremental and Answer Subsumption Tabling. 479-484 - Nicolas Schwind, Katsumi Inoue:
Characterization Theorems for Revision of Logic Programs. 485-498 - Peter Schüller:
Flexible Combinatory Categorial Grammar Parsing Using the CYK Algorithm and Answer Set Programming. 499-511 - Martin Slota, Martin Baláz, João Leite:
Early Recovery in Logic Program Updates. 512-517 - Samy Sá, João F. L. Alcântara:
Preference Handling for Belief-Based Rational Decisions. 518-523 - Giorgio Terracina, Alessandra Martello, Nicola Leone:
Logic-Based Techniques for Data Cleaning: An Application to the Italian National Healthcare System. 524-529 - Carlos Viegas Damásio, Anastasia Analyti, Grigoris Antoniou:
Justifications for Logic Programming. 530-542 - Yisong Wang, Zhiqiang Zhuang, Kewen Wang:
Belief Change in Nonmonotonic Multi-Context Systems. 543-555 - Ying Zhu, Miroslaw Truszczynski:
On Optimal Solutions of Answer Set Optimization Problems. 556-568
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-11-08 20:17 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:
