The DLV system for knowledge representation and reasoning
DOI10.1145/1149114.1149117zbMATH Open1367.68308OpenAlexW1976055110WikidataQ59259670 ScholiaQ59259670MaRDI QIDQ5277755FDOQ5277755
Georg Gottlob, Gerald Pfeifer, Francesco Scarcello, Simona Perri, N. 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 complexitynonmonotonic reasoningimplementationknowledge representationstable modelsanswer sets
Knowledge representation (68T30) Logic programming (68N17) Logic in artificial intelligence (68T27) Descriptive complexity and finite models (68Q19)
Cited In (only showing first 100 items - show all)
- Snapshot Generation in a Constructive Object-Oriented Modeling Language
- Vicious Circle Principle and Logic Programs with Aggregates
- The Intelligent Grounder of DLV
- Domain expansion for ASP-programs with external sources
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Combining event calculus and description logic reasoning via logic programming
- Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules
- Computable Functions in ASP: Theory and Implementation
- Safe Formulas in the General Theory of Stable Models (Preliminary Report)
- Semantics and complexity of recursive aggregates in answer set programming
- Lpopt: a rule optimization tool for answer set programming
- Outlier detection using default reasoning
- The Design of the Sixth Answer Set Programming Competition
- Logic programs with abstract constraint atoms: the role of computations
- Tractability frontiers of the partner units configuration problem
- John McCarthy's legacy
- Answer Set Programming: A Primer
- Reasoning with infinite stable models
- Equilibrium logic
- Magic Sets and their application to data integration
- An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints
- Synonymous theories and knowledge representations in answer set programming
- A program-level approach to revising logic programs under the answer set semantics
- Solving Disjunctive Fuzzy Answer Set Programs
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
- From answer set logic programming to circumscription via logic of GK
- Loop-separable programs and their first-order definability
- LARS: a logic-based framework for analytic reasoning over streams
- Disjunctive logic programs with existential quantification in rule heads
- A first order nonmonotonic extension of constructive logic
- Advances in WASP
- Automated reformulation of specifications by safe delay of constraints
- atalog: A logic language for expressing search and optimization problems
- Implementing Preferences with asprin
- Reducing fuzzy answer set programming to model finding in fuzzy logics
- Finding explanations of inconsistency in multi-context systems
- Complex optimization in answer set programming
- Causes and explanations in the structural-model approach: Tractable cases
- Answer set programming based on propositional satisfiability
- The Seventh Answer Set Programming Competition: Design and Results
- On the complexity of identifying head-elementary-set-free programs
- Evaluating ASP and commercial solvers on the CSPLib
- Combining decidability paradigms for existential rules
- A core language for fuzzy answer set programming
- Backdoors to Normality for Disjunctive Logic Programs
- Team-building with answer set programming in the Gioia-Tauro seaport
- Modular action language
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems withIDP3
- Aggregated fuzzy answer set programming
- A general framework for preferences in answer set programming
- Exploiting functional dependencies in declarative problem specifications
- Possibilistic uncertainty handling for answer set programming
- Combining answer set programming with description logics for the semantic web
- Conflict-driven answer set solving: from theory to practice
- Magic sets for disjunctive Datalog programs
- Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There
- Multi-shot ASP solving with clingo
- Design and results of the Fifth Answer Set Programming Competition
- The loop formula based semantics of description logic programs
- Probabilistic reasoning with answer sets
- Backdoors to tractable answer set programming
- Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results
- The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments
- Scaling-up reasoning and advanced analytics on BigData
- $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
- Semantic forgetting in answer set programming
- Extended RDF: computability and complexity issues
- Expressive power and abstraction in Essence
- Conflict-driven ASP solving with external sources
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences
- Methods for solving reasoning problems in abstract argumentation -- a survey
- Learning Through Hypothesis Refinement Using Answer Set Programming
- Detecting Inconsistencies in Large Biological Networks with Answer Set Programming
- Disjunctive answer set solvers via templates
- Program Correspondence under the Answer-Set Semantics: The Non-ground Case
- Title not available (Why is that?)
- Modern Datalog Engines
- Rewriting optimization statements in answer-set programs
- To Vladimir Lifschitz on His 65th Birthday
- Towards a Type Discipline for Answer Set Programming
- Contextual Data Tailoring Using ASP
- Normal Form Nested Programs
- Abstraction for non-ground answer set programs
- Inconsistency Management for Traffic Regulations: Formalization and Complexity Results
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- On combining ontologies and rules
- Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
- Abstract Solvers for Computing Cautious Consequences of ASP programs
- Logic programming
- Answer set programming made easy
- FOLASP: FO(Β·) as Input Language for Answer Set Solvers
- Advancing Lazy-Grounding ASP Solving Techniques β Restarts, Phase Saving, Heuristics, and More
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel instantiation of ASP programs: techniques and experiments
- Fifty Years of Prolog and Beyond
- Preface
- Consistent query answering via ASP from different perspectives: Theory and practice
- Adaptive large-neighbourhood search for optimisation in answer-set programming
- Testing and debugging techniques for answer set solver development
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Efficient description logic reasoning in Prolog: The DLog system π π
- DL-learner: learning concepts in description logics π π
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system π π
- Declarative problem-solving using the DLV system π π
- Description logics in knowledge representation π π
- The<scp>dlvhex</scp>system for knowledge representation: recent advances (system description) π π
This page was built for publication: The DLV system for knowledge representation and reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5277755)