Results 61 to 70 of about 570,700 (231)
Prioritizing Answer Sets Based on Conditional Expert Knowledge
Answer set programming (ASP) and conditional reasoning both are powerful and widely used methodologies from the field of knowledge representation and reasoning (KR) which are capable of formalizing default statements that usually hold but also leave room
Marco Wilhelm +2 more
doaj +1 more source
Answer Set Programming with External Sources [PDF]
Answer Set Programming (ASP) is a well-known problem solving approach based on nonmonotonic logic programs and efficient solvers. To enable access to external information, HEX-programs extend programs with external atoms, which allow for a bidirectional ...
Redl, Christoph
core +1 more source
Backdoors to tractable answer set programming
Answer Set Programming (ASP) is an increasingly popular framework for declarative programming that admits the description of problems by means of rules and constraints that form a disjunctive logic program. In particular, many AI problems such as reasoning in a nonmonotonic setting can be directly formulated in ASP.
Johannes Klaus Fichte, Stefan Szeider
openaire +5 more sources
Explainable Answer-set Programming
The interest in explainability in artificial intelligence (AI) is growing vastly due to the near ubiquitous state of AI in our lives and the increasing complexity of AI systems. Answer-set Programming (ASP) is used in many areas, among them are industrial optimisation, knowledge management or life sciences, and thus of great interest in the context of ...
openaire +2 more sources
When it comes to the writing of a new logic program or theory, it is of great importance to obtain a concise and minimal representation, for simplicity and ease of interpretation reasons.
Rodrigo Martin, Pedro Cabalar
doaj +1 more source
Case Study: Students’ Code-Tracing Skills and Calibration of Questions for Computer Adaptive Tests
Computer adaptive testing (CAT) enables an individualization of tests and better accuracy of knowledge level determination. In CAT, all test participants receive a uniquely tailored set of questions.
Robert Pinter +5 more
doaj +1 more source
DynASP2.5: Dynamic Programming on Tree Decompositions in Action
Efficient exact parameterized algorithms are an active research area. Such algorithms exhibit a broad interest in the theoretical community. In the last few years, implementations for computing various parameters (parameter detection) have been ...
Johannes K. Fichte +3 more
doaj +1 more source
A Multi-Engine Approach to Answer Set Programming [PDF]
Answer Set Programming (ASP) is a truly-declarative programming paradigm proposed in the area of non-monotonic reasoning and logic programming, that has been recently employed in many applications.
Maratea, Marco +2 more
core +1 more source
Designing experiments to discriminate families of logic models
Logic models of signaling pathways are a promising way of building effective in silico functional models of a cell, in particular of signaling pathways.
Santiago eVidela +10 more
doaj +1 more source
Dynamic Consistency Checking in Goal-Directed Answer Set Programming
In answer set programming, inconsistencies arise when the constraints placed on a program become unsatisfiable. In this paper, we introduce a technique for dynamic consistency checking for our goal-directed method for computing answer sets, under which ...
Gupta, Gopal, Marple, Kyle
core +1 more source

