Answer set based design of knowledge systems
DOI10.1007/S10472-006-9026-1zbMATH Open1105.68105OpenAlexW2025327371MaRDI QIDQ854966FDOQ854966
Authors: Marcello Balduccini, Michael Gelfond, Monica Nogueira 
Publication date: 20 December 2006
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://cdr.lib.unc.edu/downloads/6969z904g
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Knowledge representation (68T30) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)
Cites Work
- Extending and implementing the stable model semantics
- Title not available (Why is that?)
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Title not available (Why is that?)
- Planning for temporally extended goals.
- Extending the Smodels system with cardinality and weight constraints
- Representing action and change by logic programs
- Title not available (Why is that?)
- Using temporal logics to express search control knowledge for planning
- Logic programming and knowledge representation
- Diagnostic reasoning with A-Prolog
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reasoning agents in dynamic domains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Logic programming and knowledge representation---The A-Prolog perspective
- A note on the stable model semantics for logic programs
- Title not available (Why is that?)
Cited In (14)
- Logic programs with abstract constraint atoms: the role of computations
- Splitting a CR-Prolog Program
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- Integrating answer set programming and constraint logic programming
- Title not available (Why is that?)
- Action-centered information retrieval
- CASP solutions for planning in hybrid domains
- Justifications for logic programs under answer set semantics
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- Approximation of action theories and its application to conformant planning
- Inconsistency proofs for ASP: the ASP-DRUPE format
- Selection of search strategies for solving 3-SAT problems
- Dual-normal logic programs -- the forgotten class
- Constraint Answer Set Solving
Uses Software
This page was built for publication: Answer set based design of knowledge systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854966)
