The DLV system for knowledge representation and reasoning
From MaRDI portal
Publication:5277755
DOI10.1145/1149114.1149117zbMath1367.68308OpenAlexW1976055110WikidataQ59259670 ScholiaQ59259670MaRDI QIDQ5277755
Georg Gottlob, Gerald Pfeifer, Francesco Scarcello, Simona Perri, Nicola Leone, Wolfgang Faber, Thomas Eiter
Publication date: 12 July 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1149114.1149117
computational complexityknowledge representationimplementationnonmonotonic reasoningstable modelsanswer sets
Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic programming (68N17) Descriptive complexity and finite models (68Q19)
Related Items
Backdoors to Normality for Disjunctive Logic Programs, A Model for Phase Transition of Random Answer-Set Programs, Index Sets for Finite Normal Predicate Logic Programs with Function Symbols, Reasoning about actions with Temporal Answer Sets, Consistent query answering via ASP from different perspectives: Theory and practice, Parallel instantiation of ASP programs: techniques and experiments, Scaling-up reasoning and advanced analytics on BigData, Unnamed Item, Modern Datalog Engines, FOLASP: FO(·) as Input Language for Answer Set Solvers, Fifty Years of Prolog and Beyond, A general framework for preferences in answer set programming, Model enumeration in propositional circumscription via unsatisfiable core analysis, Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems withIDP3, Random logic programs: Linear model, Modular action language, Disjunctive answer set solvers via templates, Stable-unstable semantics: Beyond NP with normal logic programs, The<scp>dlvhex</scp>system for knowledge representation: recent advances (system description), Consistency and trust in peer data exchange systems, Temporal logic programs with variables, ASPeRiX, a first-order forward chaining approach for answer set computing, ASP and subset minimality: enumeration, cautious reasoning and MUSes, Beyond NP: Quantifying over Answer Sets, Abstract Solvers for Computing Cautious Consequences of ASP programs, Better Paracoherent Answer Sets with Less Resources, Partial Compilation of ASP Programs, Answer-set programs for reasoning about counterfactual interventions and responsibility scores for classification, On combining ontologies and rules, Score-based explanations in data management and machine learning: an answer-set programming approach to counterfactual analysis, Answer set programming made easy, Stepwise debugging of answer-set programs, Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Rewriting optimization statements in answer-set programs, Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More, Reducing fuzzy answer set programming to model finding in fuzzy logics, Disjunctive logic programs with existential quantification in rule heads, Combining decidability paradigms for existential rules, D-FLAT: Declarative problem solving using tree decompositions and answer-set programming, Conflict-driven ASP solving with external sources, Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs, Complexity of super-coherence problems in ASP, Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets, Multi-shot ASP solving with clingo, Answering the “why” in answer set programming – A survey of explanation approaches, Experimenting with recursive queries in database and logic programming systems, Optimizing Answer Set Computation via Heuristic-Based Decomposition, The Seventh Answer Set Programming Competition: Design and Results, Efficiently Coupling the I-DLV Grounder with ASP Solvers, Solving Advanced Argumentation Problems with Answer Set Programming, Abstraction for non-ground answer set programs, Preface, Normal Form Nested Programs, Snapshot Generation in a Constructive Object-Oriented Modeling Language, Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There, Detecting Inconsistencies in Large Biological Networks with Answer Set Programming, Computable Functions in ASP: Theory and Implementation, Program Correspondence under the Answer-Set Semantics: The Non-ground Case, Safe Formulas in the General Theory of Stable Models (Preliminary Report), Tractability frontiers of the partner units configuration problem, On elementary loops of logic programs, The delay and window size problems in rule-based stream reasoning, Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies, Combining event calculus and description logic reasoning via logic programming, Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules, Disjunctive logic programming with types and objects: the \(\mathrm{DLV}^{+}\) system, Advances in WASP, Implementing Preferences with asprin, Progress in clasp Series 3, Multi-level Algorithm Selection for ASP, Solving Disjunctive Fuzzy Answer Set Programs, Characterising and Explaining Inconsistency in Logic Programs, The Design of the Sixth Answer Set Programming Competition, To Vladimir Lifschitz on His 65th Birthday, The Intelligent Grounder of DLV, Algorithms for Solving Satisfiability Problems with Qualitative Preferences, Declarative Distributed Computing, Contextual Data Tailoring Using ASP, Team-building with answer set programming in the Gioia-Tauro seaport, Characterising equilibrium logic and nested logic programs: Reductions and complexity,, Inconsistency Management for Traffic Regulations: Formalization and Complexity Results, LARS: a logic-based framework for analytic reasoning over streams, Equilibrium logic, Possibilistic uncertainty handling for answer set programming, Maintenance goals of agents in a dynamic environment: formulation and policy construction, Combining answer set programming with description logics for the semantic web, Semantic forgetting in answer set programming, Outlier detection using default reasoning, Cautious reasoning in ASP via minimal models and unsatisfiable cores, Answer set programming based on propositional satisfiability, Vicious Circle Principle and Logic Programs with Aggregates, Anytime Computation of Cautious Consequences in Answer Set Programming, Improving the Normalization of Weight Rules in Answer Set Programs, Lpopt: a rule optimization tool for answer set programming, Craig interpolation with clausal first-order tableaux, Magic Sets and their application to data integration, Learning Through Hypothesis Refinement Using Answer Set Programming, Many-valued dynamic object-oriented inheritance and approximations, Ontology-based semantic search on the web and its combination with the power of inductive reasoning, $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols, Synonymous theories and knowledge representations in answer set programming, An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints, Design and results of the Fifth Answer Set Programming Competition, What is answer set programming to propositional satisfiability, Relational data factorization, Extended RDF: computability and complexity issues, Optimising business process discovery using answer set programming, A core language for fuzzy answer set programming, On the limits of forgetting in answer set programming, Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results, Implementing Prioritized Circumscription by Computing Disjunctive Stable Models, Finding explanations of inconsistency in multi-context systems, Practical algorithms for MSO model-checking on tree-decomposable graphs, Automated reformulation of specifications by safe delay of constraints, Causes and explanations in the structural-model approach: Tractable cases, atalog: A logic language for expressing search and optimization problems, Expressive power and abstraction in Essence, Rough set reasoning using answer set programs, Why-provenance information for RDF, rules, and negation, Conflict-driven answer set solving: from theory to practice, Magic sets for disjunctive Datalog programs, Logic programs with abstract constraint atoms: the role of computations, John McCarthy's legacy, From answer set logic programming to circumscription via logic of GK, Semantics and complexity of recursive aggregates in answer set programming, Loop-separable programs and their first-order definability, A program-level approach to revising logic programs under the answer set semantics, Testing and debugging techniques for answer set solver development, Equivalence between answer-set programs under (partially) fixed input, Automata and Answer Set Programming, Probabilistic reasoning with answer sets, Modeling multi-valued biological interaction networks using fuzzy answer set programming, Determining inference semantics for disjunctive logic programs, Fixed point semantics for stream reasoning, Pruning external minimality checking for answer set programs using semantic dependencies, Complex optimization in answer set programming, Evaluating ASP and commercial solvers on the CSPLib, Dealing Automatically with Exceptions by Introducing Specificity in ASP, Towards a Type Discipline for Answer Set Programming, Answer Set Programming: A Primer, Answers set programs for non-transferable utility games: expressiveness, complexity and applications, Exploiting functional dependencies in declarative problem specifications, The loop formula based semantics of description logic programs, On the complexity of identifying head-elementary-set-free programs, The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments, Aggregated fuzzy answer set programming, Writing Declarative Specifications for Clauses, Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs, Vicious circle principle, aggregates, and formation of sets in ASP based languages, Computing only minimal answers in disjunctive deductive databases, Graph-based construction of minimal models, The dramatic true story of the frame default, Methods for solving reasoning problems in abstract argumentation -- a survey, Backdoors to tractable answer set programming, A first order nonmonotonic extension of constructive logic, Domain expansion for ASP-programs with external sources, Using possibilistic logic for modeling qualitative decision: answer set programming algorithms, Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions, Reasoning with infinite stable models
