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 13 of 13 for “"Answer Set Programming"”.

  1. 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

    potsdam-diss Repository record for Preferences in answer set programming (opens in a new tab)

  2. Epistemic extensions of answer set programming

    … to avoid unintuitive conclusions in specific settings. In addition; where the first leader has the first say and may remove models that he or she finds unsatisfactory. Using this particular communication mechanism allows us to capture the entire polynomial hierarchy. Secondly; where each …

    ghent Repository record for Epistemic extensions of answer set programming (opens in a new tab)

  3. 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. …

    ghent Repository record for Foundations of fuzzy answer set programming (opens in a new tab)

  4. 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 …

    potsdam-diss Repository record for Modeling biological systems with Answer Set Programming (opens in a new tab)

  5. 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 …

    potsdam-diss Repository record for Proof theory and algorithms for answer set programming (opens in a new tab)

  6. 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. …

    potsdam-diss Repository record for Reasoning on the response of logical signaling networks with answer set programming (opens in a new tab)

  7. 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 …

    potsdam-diss Repository record for Algorithm selection, scheduling and configuration of Boolean constraint solvers (opens in a new tab)

  8. Architecture synthesis for adaptive multiprocessor systems on chip

    … the design space. Given a parallel program and a set of an IP library, the automated synthesis problem is to simultaneously (i) select processors (ii) map and schedule tasks to them, and (iii) select one or several networks for inter-task communications such that design constraints and …

    potsdam-diss Repository record for Architecture synthesis for adaptive multiprocessor systems on chip (opens in a new tab)

  9. Ein Bedingungsmodell für Planungsprobleme in strukturierten Domänen

    … logikbasierter Ansatz mit Constraints, nämlich Answer Set Programming mit Gewichten, als eine ausgezeichnete Methode bezüglich der Ausdrucksstärke, Mächtigkeit und Adäquatheit. Die Praxistauglichkeit des verfolgten Ansatzes im Hinblick auf Performanz und Skalierbarkeit wird in verschiedenen …

    passau-thes Repository record for Ein Bedingungsmodell für Planungsprobleme in strukturierten Domänen (opens in a new tab)

  10. 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 …

    uiuc Repository record for Possible worlds explorer: Combining declarative programming with user-friendly Jupyter Notebooks (opens in a new tab)

  11. 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 …

    ttu Repository record for Refining the semantics for epistemic logic programs (opens in a new tab)

  12. Entwurf, Methoden und Werkzeuge für komplexe Bildverarbeitungssysteme auf Rekonfigurierbaren System-on-Chip-Architekturen

    … sie gut kennen, anstatt eine Architektur einzusetzen, die am besten zur Anwendung passt. Bildverarbeitungsalgorithmen sind inhärent parallel, doch herkömmliche bildverarbeitende eingebettete Systeme basieren meist auf sequentiell arbeitenden Prozessoren. Im Gegensatz zu dieser "Unstimmigkeit" …

    potsdam-diss Repository record for Entwurf, Methoden und Werkzeuge für komplexe Bildverarbeitungssysteme auf Rekonfigurierbaren System-on-Chip-Architekturen (opens in a new tab)