Pages that link to "Item:Q4428287"
From MaRDI portal
The following pages link to Knowledge Representation, Reasoning and Declarative Problem Solving (Q4428287):
Displaying 50 items.
- Learning Boolean controls in regulated metabolic networks: a case-study (Q2142113) (← links)
- A polynomial reduction of forks into logic programs (Q2144173) (← links)
- Static analysis and stochastic search for reachability problem (Q2229143) (← links)
- Rough set reasoning using answer set programs (Q2237125) (← links)
- Paracoherent answer set computation (Q2238696) (← links)
- Determining inference semantics for disjunctive logic programs (Q2289011) (← links)
- A parallel memory-efficient epistemic logic program solver: harder, better, faster (Q2317970) (← links)
- Forgetting auxiliary atoms in forks (Q2321342) (← links)
- The dramatic true story of the frame default (Q2341259) (← links)
- Methods for solving reasoning problems in abstract argumentation -- a survey (Q2341832) (← links)
- Possibilistic nested logic programs and strong equivalence (Q2344722) (← links)
- Fuzzy autoepistemic logic and its relation to fuzzy answer set programming (Q2351607) (← links)
- Using possibilistic logic for modeling qualitative decision: answer set programming algorithms (Q2353982) (← links)
- Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions (Q2353984) (← links)
- Disjunctive logic programming with types and objects: the \(\mathrm{DLV}^{+}\) system (Q2372203) (← links)
- Combining answer set programming with description logics for the semantic web (Q2389666) (← links)
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits (Q2389669) (← links)
- Complexity results for answer set programming with bounded predicate arities and implications (Q2426101) (← links)
- On look-ahead heuristics in disjunctive logic programming (Q2426102) (← links)
- Model checking multi-agent systems with logic based Petri nets (Q2426108) (← links)
- Revisiting \(\mathbb Z\) (Q2443124) (← links)
- FLP answer set semantics without circular justifications for general logic programs (Q2453743) (← links)
- Solving logic program conflict through strong and weak forgettings (Q2457621) (← links)
- An introduction to fuzzy answer set programming (Q2457803) (← links)
- A rule based knowledge transaction model for mobile environments (Q2509213) (← links)
- Identification of biological regulatory networks from process hitting models (Q2513608) (← links)
- Alan: An action language for modelling non-Markovian domains (Q2574883) (← links)
- Semantics for possibilistic disjunctive programs (Q2845121) (← links)
- A “Conservative” Approach to Extending Answer Set Programming with Non-Herbrand Functions (Q2900504) (← links)
- Gearing Up for Effective ASP Planning (Q2900527) (← links)
- Toward Question Answering in Travel Domains (Q2900529) (← links)
- Declarative Distributed Computing (Q2900541) (← links)
- Disjunctive Programs with Set Constraints (Q2900542) (← links)
- Answer Set Programming and Planning with Knowledge and World-Altering Actions in Multiple Agent Domains (Q2900545) (← links)
- A Selective Semantics for Logic Programs with Preferences (Q2915073) (← links)
- <tt>claspfolio</tt>2: Advances in Algorithm Selection for Answer Set Programming (Q2931265) (← links)
- Anytime Computation of Cautious Consequences in Answer Set Programming (Q2931278) (← links)
- The rise and fall of semantic rule updates based on<tt>SE</tt>-models (Q2933088) (← links)
- A Logic for Qualified Syllogisms (Q2940787) (← links)
- Learning Through Hypothesis Refinement Using Answer Set Programming (Q2943878) (← links)
- Extending Unification in $\mathcal{EL}$ to Disunification: The Case of Dismatching and Local Disunification (Q2974785) (← links)
- Answer Set Programming for Computing Decisions Under Uncertainty (Q3011968) (← links)
- Handling Exceptions in Logic Programming without Negation as Failure (Q3011970) (← links)
- Automatic network reconstruction using ASP (Q3087459) (← links)
- Complex optimization in answer set programming (Q3087462) (← links)
- Characterising equilibrium logic and nested logic programs: Reductions and complexity, (Q3181745) (← links)
- Characterizations of stable model semantics for logic programs with arbitrary constraint atoms (Q3183130) (← links)
- (Q3200589) (← links)
- Expressive power of knowledge representation systems (Q3327749) (← links)
- aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming (Q3449196) (← links)
