Knowledge Representation, Reasoning and Declarative Problem Solving
From MaRDI portal
Publication:4428287
DOI10.1017/CBO9780511543357zbMath1056.68139MaRDI QIDQ4428287
Publication date: 15 September 2003
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68T27: Logic in artificial intelligence
68T30: Knowledge representation
68T35: Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68N17: Logic programming
Related Items
Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming, Updates in answer set programming: An approach based on basic structural properties, Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets, Experimenting with recursive queries in database and logic programming systems, Logic programs with monotone abstract constraint atoms, Comparative uncertainty: theory and automation, Model-Based Knowledge Representation and Reasoning Via Answer Set Programming, A Theoretical Framework for the Declarative Debugging of Datalog Programs, Snapshot Generation in a Constructive Object-Oriented Modeling Language, Authorization and Obligation Policies in Dynamic Systems, Quo Vadis Answer Set Programming?, Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There, Detecting Inconsistencies in Large Biological Networks with Answer Set Programming, Automatic Composition of Melodic and Harmonic Music by Answer Set Programming, Engineering an Incremental ASP Solver, Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories, Computable Functions in ASP: Theory and Implementation, Composing Normal Programs with Function Symbols, Quantified Equilibrium Logic and Foundations for Answer Set Programs, Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence, Relativized Hyperequivalence of Logic Programs for Modular Programming, Normal Form Nested Programs, Logic programming with infinite sets, A first order nonmonotonic extension of constructive logic, Enhancing disjunctive logic programming systems by SAT checkers, Reasoning with infinite stable models, Answer set based design of knowledge systems, Strong order equivalence, Equilibrium logic, Open answer set programming for the semantic web, Modeling biological networks by action languages via answer set programming, Linear temporal logic as an executable semantics for planning languages, Integrating answer set programming and constraint logic programming, Consistency properties and set based logic programming, Set based logic programming, Safe beliefs for propositional theories, Disjunctive logic programming with types and objects: the \(\mathrm{DLV}^{+}\) system, Combining answer set programming with description logics for the semantic web, Heuristics for planning with penalties and rewards formulated in logic and computed through circuits, Complexity results for answer set programming with bounded predicate arities and implications, On look-ahead heuristics in disjunctive logic programming, Model checking multi-agent systems with logic based Petri nets, Solving logic program conflict through strong and weak forgettings, An introduction to fuzzy answer set programming, A rule based knowledge transaction model for mobile environments, Alan: An action language for modelling non-Markovian domains, The Semantics of Consistency and Trust in Peer Data Exchange Systems, Qualitative Constraint Enforcement in Advanced Policy Specification, Strongly Equivalent Temporal Logic Programs, Design and implementation of aggregate functions in the DLV system, Logic programming with social features, Extended ASP Tableaux and rule redundancy in normal logic programs, Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs, Automata and Answer Set Programming, Justifications for logic programs under answer set semantics, Probabilistic reasoning with answer sets, On finitely recursive programs, Towards a Type Discipline for Answer Set Programming, General Fuzzy Answer Set Programs
