Add to ORKGThis paper presents the IDP system, a finite model generator for extended first-order logic theories. IDP can be used as a didactic tool in courses on (first-order) logic. It can also be applied to solve various constraint problems and for lightweight verification tasks.status: publishe
International audienceThis paper reports on the use of the FO(*) language and the IDP framework for ...
This paper reports on the use of the \fodot language and the IDP framework for modeling and solving ...
Abstract. Recent years have seen considerable interest in procedures for com-puting finite models of...
Abstract. The model expansion (MX) search problem consists of find-ing models of a given theory T th...
per Predicate Logic as a Programming Language was a breakthrough for the use of logic in computer sc...
The traditional approach to model expansion (generating models of a logic theory extending a partial...
This paper provides a gentle introduction to problem solving with the IDP3 system. The core of IDP3 ...
This paper provides a gentle introduction to problem solving with the IDP3 system. The core of IDP3 ...
This paper focuses on computing first-order theories under either stable model semantics or circumsc...
In Answer Set Programming (ASP), programs can be viewed as specifications of finite Herbrand structu...
In answer-set programming (ASP), programs can be viewed as specifications of finite Herbrand structu...
This paper focuses on computing first-order theo-ries under either stable model semantics or circum-...
In this dissertation, we investigate various sorts of reasoning on finite structures and theories in...
We implement a MACE-style method for finding finite models in unsorted classical first-order logic. ...
The authors of [MT05] proposed a declarative constraint programming framework based on classical log...
International audienceThis paper reports on the use of the FO(*) language and the IDP framework for ...
This paper reports on the use of the \fodot language and the IDP framework for modeling and solving ...
Abstract. Recent years have seen considerable interest in procedures for com-puting finite models of...
Abstract. The model expansion (MX) search problem consists of find-ing models of a given theory T th...
per Predicate Logic as a Programming Language was a breakthrough for the use of logic in computer sc...
The traditional approach to model expansion (generating models of a logic theory extending a partial...
This paper provides a gentle introduction to problem solving with the IDP3 system. The core of IDP3 ...
This paper provides a gentle introduction to problem solving with the IDP3 system. The core of IDP3 ...
This paper focuses on computing first-order theories under either stable model semantics or circumsc...
In Answer Set Programming (ASP), programs can be viewed as specifications of finite Herbrand structu...
In answer-set programming (ASP), programs can be viewed as specifications of finite Herbrand structu...
This paper focuses on computing first-order theo-ries under either stable model semantics or circum-...
In this dissertation, we investigate various sorts of reasoning on finite structures and theories in...
We implement a MACE-style method for finding finite models in unsorted classical first-order logic. ...
The authors of [MT05] proposed a declarative constraint programming framework based on classical log...
International audienceThis paper reports on the use of the FO(*) language and the IDP framework for ...
This paper reports on the use of the \fodot language and the IDP framework for modeling and solving ...
Abstract. Recent years have seen considerable interest in procedures for com-puting finite models of...