Results 51 to 60 of about 158 (143)
Progression semantics for disjunctive logic programs
, 2011 In this paper, we extend the progression semantics for first-order disjunctive logic programs and show that it coincides with the stable model semantics.
Zhang, Yan (R8899) +3 more
core +1 more source
Maximum number of zeroes of polynomials on weighted projective spaces over a finite field
Bulletin of the London Mathematical Society, Volume 58, Issue 6, June 2026.Abstract We compute the maximum number of rational points at which a homogeneous polynomial can vanish on a weighted projective space over a finite field, provided that the first weight is equal to 1. This solves a conjecture by Aubry, Castryck, Ghorpade, Lachaud, O'Sullivan and Ram, which stated that a Serre‐like bound holds with equality for weighted
Jade Nardi, Rodrigo San‐José
wiley +1 more source
Answer Set Programming and Other Computing Paradigms [PDF]
, 2013 : Answer Set Programming (ASP) is one of the most prominent and successful knowledge representation paradigms. The success of ASP is due to its expressive non-monotonic modeling language and its efficient computational methods originating from building ...
core
Seeing confusion through a new lens: on the impact of atoms of confusion on novices' code comprehension. [PDF]
Empir Softw Eng, 2023 da Costa JAS +5 more
europepmc +1 more source
Automorphism groups of P1$\mathbb {P}^1$‐bundles over geometrically ruled surfaces
Journal of the London Mathematical Society, Volume 113, Issue 6, June 2026.Abstract We classify the pairs (X,π)$(X,\pi)$, where π:X→S$\pi \colon X\rightarrow S$ is a P1$\mathbb {P}^1$‐bundle over a non‐rational geometrically ruled surface S$S$ and Aut∘(X)$\mathrm{Aut}^\circ (X)$ is relatively maximal, that is, maximal with respect to the inclusion in the group Bir(X/S)$\mathrm{Bir}(X/S)$.
Pascal Fong
wiley +1 more source
Constraint Answer Set Programming
, 2012 Constraint answer set programming (CASP) is a novel, promising direction of research whose roots go back to propositional satisfiability (SAT). SAT solvers are efficient tools for solving boolean constraint satisfaction problems that arise in different ...
Lierler, Yuliya, Yuliya Lierler
core
Primitivity testing in free group algebras via duality
Journal of the London Mathematical Society, Volume 113, Issue 6, June 2026.Abstract Let K$K$ be a field and F$F$ a free group. By a classical result of Cohn and Lewin, the free group algebra KF$K\left[F\right]$ is a free ideal ring (FIR): a ring over which the submodules of free modules are themselves free, and of a well‐defined rank. Given a finitely generated right ideal I⩽KF$I\leqslant K\left[F\right]$ and an element f∈I$f\
Matan Seidel +2 more
wiley +1 more source
A progression semantics for first-order logic programs
, 2017 In this paper, we propose a progression semantics for first-order normal logic programs, and show that it is equivalent to the well-known stable model (answer set) semantics.
Yi Zhou +3 more
core +1 more source
On the canonical bundle formula in positive characteristic
Journal of the London Mathematical Society, Volume 113, Issue 6, June 2026.Abstract Let f:X→Z$f:X\to Z$ be a fibration from a normal projective variety X$X$ of dimension n$n$ onto a normal curve Z$Z$ over a perfect field of characteristic p>2$p>2$. Let (X,B)$(X,B)$ be a dlt pair such that the induced pair on a general fibre is log canonical.
Marta Benozzo
wiley +1 more source
Les relations spatiales dans le raisonnement : un modèle computationnel
, 2022 Les études en psychologie du raisonnement spatial se concentrent généralement sur des problèmes de positionnement d'objets, comme par exemple "A est à gauche de B, C est à droite de B, où est A par rapport à C ?". Le modèle computationnel PRISM simule en
Olivier, François
core +1 more source