Results 61 to 70 of about 158 (143)
Boolean network sketches: a unifying framework for logical model inference. [PDF]
Beneš N +4 more
europepmc +1 more source
The geometry of zonotopal algebras II: Orlik–Terao algebras and Schubert varieties
Abstract Zonotopal algebras, introduced by Postnikov–Shapiro–Shapiro, Ardila–Postnikov, and Holtz–Ron, show up in many different contexts, including approximation theory, representation theory, Donaldson–Thomas theory, and hypertoric geometry. In the first half of this paper, we construct a perfect pairing between the internal zonotopal algebra of a ...
Colin Crowley, Nicholas Proudfoot
wiley +1 more source
First-Order Stable Model Semantics with Intensional Functions
In classical logic, nonBoolean fluents, such as the location of an object, can be naturally described by functions. However, this is not the case in answer set programs, where the values of functions are pre-defined, and nonmonotonicity of the semantics ...
Bartholomew, Michael, Lee, Joohyung
core
Efficient certification of feasibility and objective value of linear programs and its applications [PDF]
The use of linear programming in various areas has increased with the significant improvement of specialized solvers. Linear programs are used as such to model practical problems, or as subroutines in algorithms such as formal proofs or branch-and-cut ...
Dumitriu, Daniel
core +1 more source
The EZSMT Solver: Constraint Answer Set Solving meets SMT
Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. It is often informally related to the field of Satisfiability Modulo Theories.
Susman, Benjamin
core
Representing Hybrid Transition Systems in an Action Language Modulo ODEs [PDF]
: Several physical systems exist in the real world that involve continuous as well as discrete changes. These range from natural dynamic systems like the system of a bouncing ball to robotic dynamic systems such as planning the motion of a robot across ...
core
On abstract modular inference systems and solvers
Integrating diverse formalisms into modular knowledge representation systems offers increased expressivity, modeling convenience, and computational benefits.
Lierler, Yuliya, Truszczynski, Miroslaw
core +1 more source
Indefinite Pronouns Optimize the Simplicity/Informativeness Trade-Off. [PDF]
Denić M +2 more
europepmc +1 more source
Enhancing symbolic system synthesis through ASPmT with partial assignment evaluation
The design of embedded systems is becoming continuously more complex such that efficient system-level design methods are becoming crucial. Recently, combined Answer Set Programming (ASP) and Quantifier Free Integer Difference Logic (QF-IDL) solving has ...
Wanko, Philipp (M.Sc.) +7 more
core +1 more source
The computational origin of representation. [PDF]
Piantadosi ST.
europepmc +1 more source

