yusuke1997/dblp-id-title huggingface dataset:
Introduction to Mathematics of Satisfiability , Victor W. Marek, Chapman & Hall/CRC, 2009. Hardback, ISBN-13: 978-143980167-3, $89.95
Optimal Scheduling for Exposed Datapath Architectures with Buffered Processing Units by ASP
Routing Driverless Transport Vehicles in Car Assembly with Answer Set Programming
Implementing LP Systems with CP Techniques
Polymorphic Lemmas and Definitions in lambda-Prolog and Twelf
Checking Proof Transformations with ASP
Shared aggregate sets in answer set programming
Design and implementation of aggregate functions in the DLV system
Introduction to the 36th International Conference on Logic Programming Special Issue I
Region-based memory management for Mercury programs
Recurrence with affine level mappings is P-time decidable for CLP(R)
Computing stable models: worst-case performance estimates
Typing constraint logic programs
Proving correctness and completeness of normal programs - a declarative approach
MAP Inference for Probabilistic Logic Programming
Theory of finite or infinite trees revisited
Module theorem for the general theory of stable models
Book review: Dynamic Logic by David Harel, Dexter Kozen and Jerzy Tiuryn, The MIT Press, ISBN 0-262-08289-6
ValAsp: A Tool for Data Validation in Answer Set Programming
Positive Dependency Graphs Revisited
Direct Encoding of Declare Constraints in ASP
Improving PARMA trailing
Probabilistic DL Reasoning with Pinpointing Formulas: A Prolog-based Approach
On a theory of probabilistic deductive databases
Annotated defeasible logic
Multi-shot ASP solving with clingo
Optimizing phylogenetic supertrees using answer set programming
Infinite probability computation by cyclic explanation graphs
Towards Probabilistic Inductive Logic Programming with Neurosymbolic Inference and Relaxation
Non-Termination of Logic Programs Using Patterns
Introduction to the special issue on Prolog systems
Learning weak constraints in answer set programming
Well-founded and stable semantics of logic programs with aggregates
How to Build Your Own ASP-based System?!
GEM: A distributed goal evaluation algorithm for trust management
Constraint handling rules with binders, patterns and generic quantification
Relative expressiveness of defeasible logics II
Adding Plural Arguments to Curry Programs
Stable-unstable semantics: Beyond NP with normal logic programs
Complexity of super-coherence problems in ASP
Enablers and inhibitors in causal justifications of logic programs
CASP solutions for planning in hybrid domains
Combining relational algebra, SQL, constraint modelling, and local search
Automatic network reconstruction using ASP
FOLD-RM: A Scalable, Efficient, and Explainable Inductive Learning Algorithm for Multi-Category Classification of Mixed Data
Fine-Grained Timing Analysis of Digital Integrated Circuits in Answer Set Programming
Precomputing Datalog Evaluation Plans in Large-Scale Scenarios
Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation
Tree dimension in verification of constrained Horn clauses
First-order modular logic programs and their conservative extensions
Transformation-Enabled Precondition Inference
An abductive framework for computing knowledge base updates
On Correctness and Completeness of an n Queens Program
Hybrid ASP-based Approach to Pattern Mining
SUNNY: a Lazy Portfolio Approach for Constraint Solving
Schedulers and redundancy for a class of constraint propagation rules
On model checking data-independent systems with arrays without reset
Introduction to the 26th international conference on logic programming special issue
Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems
Secure Prolog Based Mobile Code
Annotating answer-set programs in Lana
Extending Transaction Logic with External Actions
An Application of ASP in Nuclear Engineering: Explaining the Three Mile Island Nuclear Accident Scenario
Semantics of templates in a compositional framework for building logics
ASP for minimal entailment in a rational extension of SROEL
Planning with Incomplete Information in Quantified Answer Set Programming
Towards multi-threaded local tabling using a common table space
Guarded resolution for Answer Set Programming
Inspecting Maude variants with GLINTS
On the Foundations of Grounding in Answer Set Programming
An effective fixpoint semantics for linear logic programs
Inference of termination conditions for numerical loops in Prolog
Deriving conclusions from non-monotonic cause-effect relations
An ASP Methodology for Understanding Narratives about Stereotypical Activities
A knowledge-based approach for selecting information sources
Web-STAR: A Visual Web-based IDE for a Story Comprehension System
Book review: Essentials of Constraint Programming by Thom Frühwirth and Slim Abdennadher, Springer, 2003, hard cover: ISBN 3-540-67623-6, ix + 145 pages
Abduction in Well-Founded Semantics and Generalized Stable Models via Tabled Dual Programs
ASP Chef Grows Mustache to Look Better
A General Framework for Dynamic MAPF Using Multi-Shot ASP and Tunnels
Counting Answer Sets of Disjunctive Answer Set Programs
Swift Markov Logic for Probabilistic Reasoning on Knowledge Graphs
The system Kato: Detecting cases of plagiarism for answer-set programs
Ticker: A system for incremental ASP-based stream reasoning
Stepwise debugging of answer-set programs
Solving Decision Theory Problems with Probabilistic Answer Set Programming
Introduction to the 35th International Conference on Logic Programming Special Issue
Conflict-driven ASP solving with external sources
Linear-Time Temporal Answer Set Programming
A Survey of the Proof-Theoretic Foundations of Logic Programming
Applications of Intuitionistic Logic in Answer Set Programming
On definite program answers and least Herbrand models
Invited editorial
Relative expressiveness of defeasible logics
Lightweight compilation of (C)LP to JavaScript
Linear tabling strategies and optimizations
Fundamental Proof Methods in Computer Science: A Computer-Based Approach, by Arkoudas and Musser, The MIT Press, Cambridge, USA, ISBN 978-0-262-03553-8
Lifted Variable Elimination for Probabilistic Logic Programming
Greedy Algorithms in Datalog
A Proof Theoretic Approach to Failure in Functional Logic Programming
A General Framework for Lazy Functional Logic, Programming with Algebraic Polymorphic Types
Generic program monitoring by trace analysis
Representing Actions in Logic-based Languages
A logic-based approach to data integration
Planning with preferences using logic programming
Decidability of the Clark's completion semantics for monadic programs and queries
A CASP-Based Solution for Traffic Signal Optimisation
Introduction to the Special Issue on Constraint Handling Rules
Using SWISH to Realize Interactive Web-based Tutorials for Logic-based Languages
Refactoring the Whitby Intelligent Tutoring System for Clean Architecture
Translating OWL and semantic web rules into prolog: Moving toward description logic programs
Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
The Role of Functions in the Stable Model Semantics
Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types
aspeed: Solver scheduling via answer set programming
An application of answer set programming to the field of second language acquisition
Abstract diagnosis for timed concurrent constraint programs
On Termination, Confluence and Consistent CHR-based Type Inference
Symbolic Parameter Learning in Probabilistic Answer Set Programming
Building Rules on Top of Ontologies for the Semantic Web with Inductive Logic Programming
Logic-based decision support for strategic environmental assessment
Default rules for Curry
Incremental copying garbage collection for WAM-based Prolog systems
Book review: Programming Constraint Services: High level Programming of Standard and New Constraint Services by Christian Schulte. Springer 2002, LNAI 2302, ISBN 3-540-43371-6
Checking the quality of clinical guidelines using automated reasoning tools
Concolic testing in logic programming
Team-building with answer set programming in the Gioia-Tauro seaport
Range-based argumentation semantics as two-valued models
Transformation-based bottom-up computation of the well-founded model
MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations
Minimal founded semantics for disjunctive logic programs and deductive databases
Finite model reasoning over existential rules
On the expressibility of stable logic programming
A datalog-based computational model for coordination-free, data-parallel systems
CoreALMlib: An ALM library translated from the Component Library
Solution Enumeration by Optimality in Answer Set Programming
Characterization of strongly equivalent logic programs in intermediate logics
Introduction Special Issue on Multiparadigm Languages and Constraint Programming
On Uniform Equivalence of Epistemic Logic Programs
Knowledge and the Action Description Language A
Knowledge-based Reasoning and Learning under Partial Observability in Ad Hoc Teamwork
The KB paradigm and its application to interactive configuration
Mapping Fusion and Synchronized Hyperedge Replacement into logic programming
Introduction to the 32nd International Conference on Logic Programming Special Issue
Finding similar/diverse solutions in answer set programming
The Power of Negation in Higher-Order Datalog
Lower complexity bounds for lifted inference
A Novel Framework for Systematic Propositional Formula Simplification Based on Existential Graphs
Revisiting Explicit Negation in Answer Set Programming
Properties of input-consuming derivations
Partial Compilation of ASP Programs
FLUX: A logic programming method for reasoning agents
Multi-threaded ASP solving with clasp
Non-termination analysis of logic programs with integer arithmetics
Improving precision of type analysis using non-discriminative union
Incremental Tabling in Support of Knowledge Representation and Reasoning
Book review: Mathematical Logic for Computer Science (Second Revised Edition) by Mordechai Ben-Ari, Springer, 2001, paperback: ISBN 1-85233-319-7
Independence-Friendly Logic: A Game-Theoretic Approach , Allen L. Mann, Gabriel Sandu and Merlijn Sevenster, Cambridge University Press, 2011. Paperback, ISBN 9780521149341, 216 pp
Conflict-Driven Inductive Logic Programming
Compositional Verification in Rewriting Logic
An ASP-based Approach to Answering Natural Language Questions for Texts
Introduction to the Special Issue on Verification and Computational Logic
Evaluation of the Implementation of an Abstract Interpretation Algorithm using Tabled CLP
Modular Answer Set Programming as a Formal Specification Language
Implementing WordNet Measures of Lexical Semantic Similarity in a Fuzzy Logic Programming System
Bounded LTL model checking with stable models
Structure learning of probabilistic logic programs by searching the clause space
On Nested Justification Systems
Diagrammatic confluence for Constraint Handling Rules
Anytime Computation of Cautious Consequences in Answer Set Programming
Enhancing a search algorithm to perform intelligent backtracking
The magic of logical inference in probabilistic programming
Completing the Picture: Complexity of Graded Modal Logics with Converse
Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation
Decidability properties for fragments of CHR
Integration Schemas for Constraint Answer Set Programming: a Case Study
Constraint-based deadlock checking of high-level specifications
Transition systems for model generators - A unifying approach
Book review: Constraint Processing by Rina Dechter, Morgan Kaufmann Publishers, 2003, ISBN 1-55860-890-7
Automating Semantic Analysis of System Assurance Cases Using Goal-Directed ASP
Introduction to the TPLP Special Issue from the 16th European Conference on Logics in Artificial Intelligence (JELIA 2019)
Optimal placement of valves in a water distribution network with CLP(FD)
Automatic generation of CHR constraint solvers
Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting
A declarative extension of horn clauses, and its significance for datalog and its applications
Introducing Computer Science to High School Students Through Logic Programming
Introduction to the 38th International Conference on Logic Programming Special Issue
Set unification
Constraint Solving and Planning with Picat by Neng-Fa Zhou , Håkan Kjellerstrand , and Jonathan Fruhman , xi + 148 pages, Springer, 2015. Paperback, ISBN 978-3-319-25881-2
Learning Distributional Programs for Relational Autocompletion
Characterising equilibrium logic and nested logic programs: Reductions and complexity ,
A short bibliography of Alain Colmerauer
Defeasible Logic Programming: An Argumentative Approach
Answer set programming as a modeling language for course timetabling
CLP(H): Constraint logic programming for hedges
A probabilistic logic programming event calculus
On termination of meta-programs
On the complexity of identifying head-elementary-set-free programs
Generalization strategies for the verification of infinite state systems
In Praise of Impredicativity: A Contribution to the Formalization of Meta-Programming
Computing LPMLN using ASP and MLN solvers
Query answering in resource-based answer set semantics
Combining Type Checking and Set Constraint Solving to Improve Automated Software Verification
Managing caching strategies for stream reasoning with reinforcement learning
Building Information Modeling Using Constraint Logic Programming
A complete and terminating execution model for Constraint Handling Rules
Paraconsistency and word puzzles
Autonomous agents coordination: Action languages meet CLP() and Linda
A Framework for Compiling Preferences in Logic Programs
Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis
Thirty years of Epistemic Specifications
Inlining External Sources in Answer Set Programs
Transformations of logic programs on infinite lists
Fast Inference for Probabilistic Answer Set Programs Via the Residual Program
A Qualitative Theory of Cognitive Attitudes and their Change
Analysing graph transformation systems through constraint handling rules
Representation sharing for Prolog
An ER-based framework for declarative web programming
Solving distributed constraint optimization problems using logic programming
Worst-case groundness analysis using definite boolean functions
Paracoherent Answer Set Semantics meets Argumentation Frameworks
Abductive Logic Programs with Penalization: Semantics, Complexity and Implementation
Optimizing compilation of constraint handling rules in HAL
Automated Hybrid Grounding Using Structural and Data-Driven Heuristics
Incremental and Iterative Learning of Answer Set Programs from Mutually Distinct Examples
Justifications for logic programs under answer set semantics
Description, Implementation, and Evaluation of a Generic Design for Tabled CLP
Debugging Non-ground ASP Programs: Technique and Graphical Tools
Guest editor's introduction Special issue on Logic Programming and the Internet
Reasoning about Cardinal Directions between 3-Dimensional Extended Objects using Answer Set Programming
Clingraph : A System for ASP-based Visualization
Extended ASP Tableaux and rule redundancy in normal logic programs
Knowledge-Based Support for Adhesive Selection: Will it Stick?
Viterbi training in PRISM
Introduction to the Special Issue on the International Joint Conference on Rules and Reasoning, RuleML+RR 2019
An Open Ended Tree
The rationale behind the concept of goal
Dynamics of knowledge in DeLP through Argument Theory Change
Learn Prolog Now! Patrick Blackburn, Johan Bos, Kristina Striegnitz: College Publications, 2006 Paperback, ISBN 1-904987-17-6, xiv + 265 pages
Concurrent goal-based execution of Constraint Handling Rules
Anytime answer set optimization via unsatisfiable core shrinking
Graphs and colorings for answer set programming
Disjunctive ASP with functions: Decidable queries and effective computation
A logic programming approach to predict effective compiler settings for embedded software
Defeasible Reasoning via Datalog¬
Inferring Termination Conditions for Logic Programs using Backwards Analysis
Abstract Solvers for Computing Cautious Consequences of ASP programs
A Syntactic Operator for Forgetting that Satisfies Strong Persistence
Vicious Circle Principle and Logic Programs with Aggregates
SeaLion: An eclipse-based IDE for answer-set programming with advanced debugging support
Parallel instantiation of ASP programs: techniques and experiments
Reasoning on Multirelational Contextual Hierarchies via Answer Set Programming with Algebraic Measures
A simple correctness proof for magic transformation
Well-definedness and efficient inference for probabilistic logic programming under the distribution semantics
XPath-Logic and XPathLog: a logic-programming-style XML data manipulation language
Probabilistic QoS-aware Placement of VNF Chains at the Edge
Computing minimal models, stable models and answer sets
Epistemic foundation of stable model semantics
When you must forget: Beyond strong persistence when forgetting in answer set programming
Adding partial functions to Constraint Logic Programming with sets
Preferred answer sets for ordered logic programs
Introduction to the special issue on computational logic for verification
Calculating modules in contextual logic program refinement
A general framework for static profiling of parametric resource usage
A design and implementation of the Extended Andorra Model
The effects of buying a new car: an extension of the IDP Knowledge Base System
In honor of Alain Colmerauer's 60th birthday
Evaluating Datalog Tools for Meta-reasoning over OWL 2 QL
Logic programming with default, weak and strict negations
Scaling-up reasoning and advanced analytics on BigData
Practical Reasoning in DatalogMTL
Splitting and updating hybrid knowledge bases
Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach
Finding Personalized Good-Enough Solutions to Unsatisfiable Stable Roommates Problems
Observational equivalences for linear logic concurrent constraint languages
Pattern-Based Compaction for ProbLog Inference
Aggregate Semantics for Propositional Answer Set Programs
Shape Neutral Analysis of Graph-based Data-structures
Dual-normal logic programs - the forgotten class
On the Semantics of Abstract Argumentation Frameworks: A Logic Programming Approach
Attribute Global Types for Dynamic Checking of Protocols in Logic-based Multiagent Systems
CLP-based protein fragment assembly
Achieving compositionality of the stable model semantics for smodels programs
Introduction to the 36th International Conference on Logic Programming Special Issue II
Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3
High-Level Networking with Mobile Code and First Order AND-Continuations
An Efficient Solver for ASP(Q)
Soft Constraint Programming to Analysing Security Protocols
A Transformation-based implementation for CLP with qualification and proximity
Random logic programs: Linear model
Minimal intervention strategies in logical signaling networks with ASP
The Stable Model Semantics for Higher-Order Logic Programming
Lambda-Calculus and Combinators, An Introduction, 2nd Edition, J. Roger Hindley and Jonathan P. Seldin, Cambridge University Press, 2008. Hardback, ISBN 9780521898850
Optimal Matching for Sharing and Linearity Analysis
The P-Box CDF-Intervals: A Reliable Constraint Reasoning with Quantifiable Information
Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective
Equivalence-checking on infinite-state systems: Techniques and results
On the existence of stable models of non-stratified logic programs
A Neuro-Symbolic ASP Pipeline for Visual Question Answering
The PITA system: Tabling and answer subsumption for reasoning under uncertainty
Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis
As time goes by: Constraint Handling Rules
An ASP Approach for Reasoning on Neural Networks under a Finitely Many-Valued Semantics for Weighted Conditional Knowledge Bases
Table space designs for implicit and explicit concurrent tabled evaluation
On the implementation of GNU Prolog
Tractable answer-set programming with weight constraints: bounded treewidth is not enough
Stable models for infinitary formulas with extensional atoms
Fuzzy answer set computation via satisfiability modulo theories
Generating Satisfiable Benchmark Instances for Stable Roommates Problems with Optimization
A General Framework for Stable Roommates Problems using Answer Set Programming
Comparing Non-Minimal Semantics for Disjunction in Answer Set Programming
On Applying Or-Parallelism and Tabling to Logic Programs
Swapping evaluation: A memory-scalable solution for answer-on-demand tabling
ASP-Based Multi-Shot Reasoning via DLV2 with Incremental Grounding
Introduction to the 37th International Conference on Logic Programming Special Issue I
The role of semantics in mining frequent patterns from knowledge bases in description logics with rules
Consistency and trust in peer data exchange systems
Multi-Shot Answer Set Programming for Flexible Payroll Management
Tabling with Sound Answer Subsumption
Answer sets for consistent query answering in inconsistent databases
Singular and plural functions for functional logic programming
Book review: Set Theory for Computing: From Decision Procedures to Declarative Programming with Sets by Domenico Cantone, Eugenio Omodeo, and Alberto Policriti, Springer, 2001, ISBN 0-387-95197-0
Business process verification with constraint temporal answer set programming
Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language +
Unfolding for CHR programs
Reasoning about Complex Networks: A Logic Programming Approach
Knowledge compilation of logic programs using approximation fixpoint theory
CNL2ASP: Converting Controlled Natural Language Sentences into ASP
Introduction to the 34-th international conference on logic programming special issue
Generating explanations for biomedical queries
The intricacies of three-valued extensional semantics for higher-order logic programs
A decidable subclass of finitary programs
Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming
Top-down and Bottom-up Evaluation Procedurally Integrated
On the interaction between sharing and linearity
Optimality in goal-dependent analysis of Sharing
Translating LPOD and CR-Prolog2 into standard answer set programs
Computing Loops with at Most One External Support Rule for Basic Logic Programs with Arbitrary Constraint Atoms
The New Normal: We Cannot Eliminate Cuts in Coinductive Calculi, But We Can Explore Them
Backjumping is Exception Handling
Book review: Programming in Prolog. Using the ISO Standard by William F. Clocksin , Christopher S. Mellish, Springer-Verlag, 2003, ISBN 3-540-00678-8
Tight logic programs
Contextual hypotheses and semantics of logic programs
claspfolio 2: Advances in Algorithm Selection for Answer Set Programming
The dlvhex system for knowledge representation: recent advances (system description)
Compositional Specification in Rewriting Logic
Interactive Text Graph Mining with a Prolog-Based Dialog Engine
Introduction to the 41 $^{st}$ International Conference on Logic Programming Special Issue
Termination prediction for general logic programs
Probabilistic Semantic Web Reasoning and Learning, by Zese Riccardo
Solving functional constraints by variable substitution
Online learning of event definitions
Constraint Answer Set Programming: Integrational and Translational (or SMT-based) Approaches
Causal Graph Justifications of Logic Programs
Solving stable matching problems using answer set programming
Performing fully parallel constraint logic programming on a quantum annealer
Tabled Abduction in Logic Programs
All about Proofs, Proofs for All , Bruno Woltzenlogel Paleo and David Delahaye, Eds., College Publications, Series Mathematical Logic and Foundations, vol. 55., 2015. Paperback, ISBN 978-1-84890-166-7, vii + 240 pages
A translational approach to constraint answer set solving
Optimal multibinding unification for sharing and linearity analysis