Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Answer set programming (18)
- Knowledge representation (12)
- Satisfiability (11)
- Workshop (11)
- Logic programming (7)
-
- ASP (5)
- Answer set solver (5)
- Energy Awareness (5)
- Parallel Processing (5)
- Propositional satisfiability (4)
- SAT (4)
- Scheduling (4)
- Syntax (4)
- Bioinformatics (3)
- CMODELS (3)
- Heuristics (3)
- High Performance Computing (3)
- Natural language processing (3)
- Optimal algorithms (3)
- Semantics (3)
- Algorithms (2)
- Disjunctive logic programming (2)
- Modular answer set solving (2)
- Solvers (2)
- ASP-SAT (1)
- ASSAT (1)
- Abstract C-Models (1)
- Acyclic network (1)
- Algorithm configuration (1)
- Algorithm portfolios (1)
Articles 61 - 63 of 63
Full-Text Articles in Physical Sciences and Mathematics
Goal-Converging Behavior Networks And Self-Solving Planning Domains, Bernhard Nebel, Yuliya Lierler
Goal-Converging Behavior Networks And Self-Solving Planning Domains, Bernhard Nebel, Yuliya Lierler
Computer Science Faculty Proceedings & Presentations
Agents operating in the real world have to deal with a constantly changing and only partially predictable environment and are nevertheless expected to choose reasonable actions quickly. One way to address this problem is to use behavior networks as proposed by Maes, which support real-time decision making. Robotic soccer appears to be one domain where behavior networks have been proven to be particularly successful. In this paper, we analyze the reason for the success by identifying conditions that make behavior networks goal converging, i.e., allow them to reach the goals regardless of which particular action selection scheme is used. In …
Ventures Into Capturing Effort In Programming, Barbara Bernal-Thomas, Briana B. Morrison
Ventures Into Capturing Effort In Programming, Barbara Bernal-Thomas, Briana B. Morrison
Computer Science Faculty Proceedings & Presentations
The quest for teaching a method of data collection in programming experiences was marked with successes and failures. We believe that software development curricula must provide students with knowledge and experience related to the practice of data collection, which will measure the effort put into a software project. By recording their past effort in software projects, students can more accurately estimate the amount of effort and time required to complete a future software project. Students can also learn the amount of effort required to develop “correct” software and begin to estimate the amount of time required, per software phase, to …
Fages' Theorem And Answer Set Programming, Yuliya Lierler, Esta Erdem, Vladimir Lifschitz
Fages' Theorem And Answer Set Programming, Yuliya Lierler, Esta Erdem, Vladimir Lifschitz
Computer Science Faculty Proceedings & Presentations
We generalize a theorem by François Fages that describes the relationship between the completion semantics and the answer set semantics for logic programs with negotiation as failure. The study of this relationship is important in connection with the emergence of answer set programming. Whenever the two semantics are equivalent, answer sets can be computed by a satisfiability solver, and the use of answer set solvers such as SMODELS and DLV is unnecessary. A logic programming representation of the blocks world due to Ilkka Niemelä is discussed as an example.