Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 9 of 9 for “"Answer set programming (ASP)"”.
-
Reasoning on the response of logical signaling networks with answer set programming
… networks by means of automated reasoning using Answer Set Programming (ASP). ASP provides a declarative language for modeling various knowledge representation and reasoning problems. Moreover, available ASP solvers provide several reasoning modes for assessing the multitude of answer sets. …
-
Possible worlds explorer: Combining declarative programming with user-friendly Jupyter Notebooks
"Datalog and Answer Set Programming (ASP) are powerful languages for rule-based database querying and constraint solving, respectively. Similarly, Python is a popular and powerful procedural programming language with applications in many domains including data science. I have developed a problem …
-
Algorithm selection, scheduling and configuration of Boolean constraint solvers
… solvers, for example, in the areas of answer set programming (ASP), the constraint satisfaction problem (CSP), propositional satisfiability (SAT) and satisfiability of quantified Boolean formulas (QBF). However, in all these areas, there exist multiple solving strategies that work well …
-
Refining the semantics for epistemic logic programs
… agent. Epistemic Specifications is a declarative programming language that is an extension of answer set programming (ASP) through the addition of modal operators K and M. Programs written in this language are called epistemic logic programs. Previously proposed semantics did not satisfy our …
-
Modeling biological systems with Answer Set Programming
… an automated way. Therefore, we want to promote Answer Set Programming (ASP) as a tool for discrete modeling in Systems Biology. ASP is a declarative problem solving paradigm, in which a problem is encoded as a logic program such that its answer sets represent solutions to the problem. ASP has …
-
Proof theory and algorithms for answer set programming
Answer Set Programming (ASP) is an emerging paradigm for declarative programming, in which a computational problem is specified by a logic program such that particular models, called answer sets, match solutions. ASP faces a growing range of applications, demanding for high-performance tools able …
-
Foundations of fuzzy answer set programming
Answer set programming (ASP) is a declarative language that is tailored towards combinatorial search problems. Although ASP has been applied to many problems, such as planning, configuration and verification of software, and database repair, it is less suitable for describing continuous problems. …
-
Preferences in answer set programming
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm, having its roots in nonmonotonic reasoning, deductive databases, and logic programming with negation as failure. The basic idea of ASP is to represent a computational problem as a logic program whose answer …
-
Epistemic extensions of answer set programming
but due to the non-monotonic nature of ASP; the weight can reflect the certainty that the rule itself is correct. ASP programs with incorrect rules may have erroneous conclusions; omitting a correct rule may also lead to errors. To derive the most certain conclusions from an uncertain ASP program; …